Sciweavers

282 search results - page 1 / 57
» Robust Query Processing through Progressive Optimization
Sort
View
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 4 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,...
VLDB
2004
ACM
97views Database» more  VLDB 2004»
13 years 10 months ago
Progressive Optimization in Action
Progressive Optimization (POP) is a technique to make query plans robust, and minimize need for DBA intervention, by repeatedly re-optimizing a query during runtime if the cardina...
Vijayshankar Raman, Volker Markl, David E. Simmen,...
MDM
2005
Springer
174views Communications» more  MDM 2005»
13 years 10 months ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
PVLDB
2008
122views more  PVLDB 2008»
13 years 4 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
EDBT
2006
ACM
127views Database» more  EDBT 2006»
14 years 4 months ago
Progressive Query Optimization for Federated Queries
Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the ...
Stephan Ewen, Holger Kache, Volker Markl, Vijaysha...