6004 search results - page 65 / 1201 » Parallelizing query optimization |
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper exploits a previously developed analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-to...
PVLDB
2010
13 years 7 months ago
2010
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
SSDBM
2007
IEEE
14 years 3 months ago
2007
IEEE
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...
SEBD
1996
13 years 10 months ago
1996
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...