loading...
Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem
Boston, Massachusetts March 30-April 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2004.131999920th International Conference on Data ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Surajit Chaudhuri, Microsoft Research
Venkatesh Ganti, Microsoft Research
Luis Gravano, Columbia University
Queries with (equality or LIKE) selection predicates over string attributes are widely used in relational databases. However, state-of-the-art techniques for estimating selectivities of string predicates are often biased towards severely underestimating selectivities. In this paper, we develop accurate selectivity estimators for string predicates that adapt to data and query characteristics, and which can exploit and build on a variety of existing estimators. A thorough experimental evaluation over real data sets demonstrates the resilience of our estimators to variations in both data and query characteristics.
Citation:
Surajit Chaudhuri, Venkatesh Ganti, Luis Gravano, "Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem," icde, pp.227, 20th International Conference on Data Engineering (ICDE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions