Selectivity estimation for string predicates: Overcoming the underestimation problem

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 227-238

  Chaudhuri, Surajit ^a   Ganti, Venkatesh ^a   Gravano, Luis ^b  

^a MICROSOFT RESEARCH   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OVERLAPPING SUBSTRINGS; QUERY EXECUTION PLANS; STRING PREDICATES; STRING VALUED DATA;

DATA MINING; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING;

QUERY LANGUAGES;

EID: 2442540147     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. th International Conference on Very Large Data Bases, pages 591-600, 2001.
2. [AC99] A. Aboulnaga and S. Chaudhuri. Self-tuning histograms: Building histograms without looking at data. In Proceedings of the 1999 ACM International Conference on Management of Data (SIGMOD), 1999.
3. [Breiman96] L. Breiman. Bagging predictors. Machine Learning 24, 123-140, 1996.
4. [BFOS84] L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and regression trees. Wadsworth, Belmont, CA, 1984.
5. [CKKM00] Z. Chen, F. Korn, N. Koudas, and S. Muthukrisrman. Selectivity estimation for Boolean queries. In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 216-225, 2000.
6. [CL02] P. Chaudhuri and W.Y. Loh. Nonparametric estimation of conditional quantiles using quantile regression trees. Bernoulli, 8:561-576, 2002.
7. [FS96] Y. Freund and R. E. Schapire. Experiments with a new boosting algorithm. Machine Learning: Proceedings of the Thirteenth International Conference, pages 148-156, 1996.
8. [IP95] Y. E. Ioannidis and V. Poosala. Balancing histogram optimality and practicality for query result size estimation. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 233-244, 1995.
9. [JKNS00] H. V. Jagadish, O. Kapitskaia, R. T. Ng, and D. Srivastava. One dimensional and multi-dimensional substring selectivity estimation. The VLDB Journal (2000) 9, pages 214-230, 2000.
10. [KVI96] P. Krishnan, J. S. Vitter, and B. R. Iyer. Estimating alphanumeric selectivity in the presence of wildcards. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pages 282-293, 1996.
11. [Ley] M. Ley. DBLP. Computer science bibliography. http://www.informatik. uni-trier.de/~ley/db.
12. [Loh02a] W.-Y. Loh. The GUIDE system for building regression trees. http://www.stat.wisc.edu/~loh/guide.html.
13. [Loh02b] W.-Y. Loh. Regression trees with unbiased variable selection and interaction detection. Statistica Sinica, 12:361-386, 2002.
14. [LWP+02] L. Lim, M. Wang, S. Padmanabhan, J. Vitter, and R. Parr. XPathLearner: An on-line self-tuning Markov histogram for XML path selectivity estimation. In Proceedings of the 28th International Conference on Very Large Databases, pages 442-453, 2002.
15. [PW00] T. Phelps and R. Wilensky. Robust hyperlinks and locations. D-Lib Magazine, 6(7), July 2000.
16. [MSHS99] J. Ming, D. Stewart, P. Hanna, and F. J. Smith. A probabilistic union model for partial temporal corruption of speech. In Automatic speech recognition and understanding workshop, Keystone, Colorado, December 1999.
17. [Sus63] E. Sussenguth. Use of trees for processing files. Communications of the ACM, 6(5):272-279, 1963.