Sciweavers

116 search results - page 4 / 24
» Estimating Compilation Time of a Query Optimizer
Sort
View
ICS
2003
Tsinghua U.
14 years 1 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua
VLDB
2001
ACM
190views Database» more  VLDB 2001»
14 years 9 days 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...
AMW
2010
13 years 9 months ago
Multiresolution Cube Estimators for Sensor Network Aggregate Queries
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 8 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
SIGMOD
2002
ACM
119views Database» more  SIGMOD 2002»
14 years 8 months ago
Rate-based query optimization for streaming information sources
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
Stratis Viglas, Jeffrey F. Naughton