Sciweavers

2217 search results - page 34 / 444
» Rank-aware Query Optimization
Sort
View
BNCOD
2011
356views Database» more  BNCOD 2011»
12 years 9 months ago
Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resul...
Abhishek Mukherji, Elke A. Rundensteiner, Matthew ...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 9 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 9 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
ICDE
2010
IEEE
172views Database» more  ICDE 2010»
14 years 4 months ago
Rule profiling for query optimizers and their implications
—Many modern optimizers use a transformation rule based framework. While there has been a lot of work on identifying new transformation rules, there has been little work focused ...
Surajit Chaudhuri, Leo Giakoumakis, Vivek R. Naras...
VLDB
2002
ACM
129views Database» more  VLDB 2002»
13 years 9 months ago
Optimizing View Queries in ROLEX to Support Navigable Result Trees
An increasing number of applications use XML data published from relational databases. For speed and convenience, such applications routinely cache this XML data locally and acces...
Philip Bohannon, Sumit Ganguly, Henry F. Korth, P....