Sciweavers

6004 search results - page 19 / 1201
» Parallelizing query optimization
Sort
View
161
Voted
VLDB
2004
ACM
118views Database» more  VLDB 2004»
15 years 11 months ago
Green Query Optimization: Taming Query Optimization Overheads through Plan Recycling
PLASTIC [1] is a recently-proposed tool to help query optimizers significantly amortize optimization overheads through a technique of plan recycling. The tool groups similar quer...
Parag Sarda, Jayant R. Haritsa
159
Voted
CIKM
2004
Springer
15 years 11 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
129
Voted
SIGMOD
1998
ACM
100views Database» more  SIGMOD 1998»
15 years 10 months ago
Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans
Navin Kabra, David J. DeWitt
DEXA
2003
Springer
108views Database» more  DEXA 2003»
15 years 11 months ago
Exploiting Similarity of Subqueries for Complex Query Optimization
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
Yingying Tao, Qiang Zhu, Calisto Zuzarte
228
Voted
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 10 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...