Sciweavers

619 search results - page 61 / 124
» Query Planning in Infomaster
Sort
View
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 8 months ago
LEO - DB2's LEarning Optimizer
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...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
16 years 4 months ago
Automated SQL tuning through trial and (sometimes) error
SQL tuning--the attempt to improve a poorly-performing execution plan produced by the database query optimizer-is a critical aspect of database performance tuning. Ironically, as ...
Herodotos Herodotou, Shivnath Babu
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 4 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
CCGRID
2005
IEEE
15 years 9 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...
CIKM
2005
Springer
15 years 9 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis