Sciweavers

116 search results - page 15 / 24
» Estimating Compilation Time of a Query Optimizer
Sort
View
EDBT
2008
ACM
118views Database» more  EDBT 2008»
14 years 8 months ago
Robustness in automatic physical database design
Automatic physical database design tools rely on "what-if" interfaces to the query optimizer to estimate the execution time of the training query workload under differen...
Kareem El Gebaly, Ashraf Aboulnaga
CGO
2003
IEEE
14 years 1 months ago
Dynamic Trace Selection Using Performance Monitoring Hardware Sampling
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
Howard Chen, Wei-Chung Hsu, Dong-yuan Chen
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
EDBT
2010
ACM
392views Database» more  EDBT 2010»
14 years 2 months ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 29 days ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff