6004 search results - page 172 / 1201 » Parallelizing query optimization |
VLDB
2001
ACM
14 years 2 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
DAWAK
2003
Springer
14 years 3 months ago
2003
Springer
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
IPPS
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...
PVM
2007
Springer
14 years 4 months ago
2007
Springer
We propose a parallel MPI search engine that is capable of automatically switching between asynchronous message passing and bulk-synchronous message passing modes of operation. Whe...