Selectivity estimation for fuzzy string predicates in large data sets

VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases

Volumn 1, Issue , 2005, Pages 397-408

  Jin, Liang ^a   Li, Chen ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; FUNCTIONS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; QUERY LANGUAGES;

FUZZY STRING; HISTOGRAM STRUCTURE; LARGE DATA SETS; QUERY OPTIMIZATION;

FUZZY SETS;

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

References (34)

1. A. Aboulnaga, A. R. Alameldeen, and J. F. Naughton. Estimating the selectivity of XML path expressions for internet scale applications. In The VLDB Journal, pages 591-600, 2001.
2. R. Anathakrishna, S. Chaudhuri, and V. Ganti. Eliminating Fuzzy Duplicates in Data Warehouses. VLDB, Aug. 2002.
3. B. Bustos, G. Navarro, and E. Ch'avez. Pivot selection techniques for proximity searching in metric spaces. In Proc. of the XXI Conference of the Chilean Computer Science Society (SCCC'01), 2001.
4. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, 2003.
5. S. Chaudhuri, V. Ganti, and L. Gravano. Selectivity estimation for string predicates: Overcoming the underestimation problem. In International Conference on Data Engineering, 2004.
6. Z. Chen, F. Korn, N. Koudas, and S. Muthukrishnan. Selectivity estimation for boolean queries. In Symposium on Principles of Database Systems, pages 216-225, 2000.
7. W. Cohen, P. Ravikumar, and S. Fienberg. A Comparison of String Metrics for Matching Names and Records. Data Cleaning Workshop in Conjunction with KDD, Aug. 2003.
8. R. F. S. Filho, A. J. M. Traina, C. T. Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In ICDE, pages 623-630, 2001.
9. J. C. Gower and P. Legendre. Metric and euclidean properties of dissimilarity coefficients. Journal of Classification, 3:5-48, 1986.
10. L. Gravano, P. Ipeirotis, N. Koudas, and D. Srivastava. Approximate Text Joins and Their Integration into an RDBMS. Proceedings of WWW, 2002.
11. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491-500, 2001.
12. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, 1998.
13. J. A. Hartigan and M. A. Wong. A k-means clustering algorithm. In Applied Statistics, pages 100-108, 1979.
14. M. A. Hernández and S. J. Stolfo. The merge/purge problem for large databases. In M. J. Carey and D. A. Schneider, editors, SIGMOD, pages 127-138, 1995.
15. H. V. Jagadish, O. Kapitskaia, R. T. Ng, and D. Srivastava. Multi-dimensional substring selectivity estimation. In The VLDB Journal, pages 387-398, 1999.
16. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal Histograms with Quality Guarantees. VLDB, pages 275-286, Aug. 1998.
17. L. Jin, N. Koudas, and C. Li. NNH: Improving performance of nearest-neighbor searches using histograms. In EDBT, 2004.
18. L. Jin, N. Koudas, C. Li, and A. K. Tung. Indexing mixed types for approximate retrieval. In Proc. of VLDB, 2005.
19. L. Jin, C. Li, and S. Mehrotra. Efficient record linkage in large data sets. In Eighth International Conference on Database Systems for Advanced Applications, 2003.
20. C. T. Jr., A. J. Traina, and C. Faloutsos. Distance exponent: A new concept for selectivity estimation in metric trees. In ICDE, 2000.
21. L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley, 1990.
22. R. P. Kooi. The Optimization of Queries in Relational Databases. PhD Thesis, Case Western Reserve University, Sept. 1980.
23. P. Krishnan, J. S. Vitter, and B. R. Iyer. Estimating alphanumeric selectivity in the presence of wildcards. In SIGMOD, pages 282-293. ACM Press, 1996.
24. M.-L. Lee, T. W. Ling, and W. L. Low. Intelliclean: a knowledge-based intelligent data cleaner. In Knowledge Discovery and Data Mining, pages 290-294, 2000.
25. L. Lim, M. Wang, S. Padmanabhan, J. Vitter, and R. Parr. Xpathlearner: an on-line selftuning markov histogram for xml path selectivity estimation. In 28th International Conference on Very Large Data Bases, 2002.
26. Z. Liu, C. Luo, J. Cho, and W. Chu. A probabilistic approach to metasearching with adaptive probing. In ICDE, 2004.
27. Y. Mattias, J. S. Vitter, and M. Wang. Dynamic Maintenance of Wavelet-Based Histograms. Proceedings of the International Conference on Very Large Databases, (VLDB), Cairo, Egypt, pages 101-111, Sept. 2000.
28. M. Muralikrishna and D. J. DeWitt. Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In SIGMOD, 1988.
29. V. Poosala, P. J. Haas, Y. E. Ioannidis, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In SIGMOD, pages 294-305, 1996.
30. S. C. Sahinalp, M. Tasan, J. Macker, and Z. M. Ozsoyoglu. Distance based indexing for string proximity search. In International Conference on Data Engineering, 2003.
31. S. Sarawagi and A. Bhamidipaty. Interactive Deduplication Using Active Learning. Proceedings of VLDB, 2002.
32. Y. Tao, C. Faloutsos, and D. Papadias. The power-method: A comprehensive estimation technique for multi-dimensional queries. In CIKM, 2003.
33. J. Vleugels and R. C. Veltkamp. Efficient image retrieval through vantage objects. In Visual Information and Information Systems, pages 575-584, 1999.
34. P. N. Yianilos and K. G. Kanzelberger. The LIKEIT intelligent string comparison facility. Technical report, NEC Research Institute, 1997.