Estimating the selectivity of approximate string queries

ACM Transactions on Database Systems

Volumn 32, Issue 2, 2007, Pages

  Mazeika, Arturas ^a   Böhlen, Michael H ^a   Koudas, Nick ^b   Srivastava, Divesh ^c,d  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b UNIVERSITY OF TORONTO   (Canada)

^c AT AND T LABS RESEARCH   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Inverse strings; Min wise hash signatures; Q grams

Indexed keywords

DATABASE STRINGS; INVERSE STRINGS; MIN-WISE HASH SIGNATURES; Q-GRAMS;

APPROXIMATION ALGORITHMS; DATABASE SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ERROR ANALYSIS; LINEAR PROGRAMMING; VIRTUAL REALITY;

QUERY PROCESSING;

EID: 34547421874     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1242524.1242529     Document Type: Article

References (31)

1. BLOHSFELD, B., KORUS, D., AND SEEGER, B. 1999. A comparison of selectivity estimators for range queries on metric attributes. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 239-250.
2. BRODER, A. Z. 1998. On the resemblance and containment of documents. In Proceedings of the SEQS'91)
3. BRODER, A. Z. 2000. Identifying and filtering near-duplicate documents. In Proceedings of the 11th Anual Symposium on Combinatorial Pattern Matching. 1-10.
4. CHAUDHURI, S., GANTI, V., AND GRAVANO, L. 2004. Selectivity estimation for string predicates: Overcoming the underestimation problem. In Proceedings of the International Conference on Data Engineering (ICDE). 227-239.
5. CHEN, Z., KORN, F., KOUDAS, N., AND MUTHUKRISHNAN, S. 2003. Generalized substring selectivity estimation. J. Comput. Syst. Sci. 66, 1, 98-132.
6. COHEN, E. 1994. Estimating the size of the transitive closure in linear time. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS) (Nov.). 190-200.
7. COHEN, E., D., M., FUJIWARA, S., GIONIS, A., INDYK, P., MOTWANI, R., ULLMAN, J. D., AND YANG, C. 2000. Finding interesting associations without support pruning. In Proceedings of the International Conference on Data Engineering (ICDE). 489-499.
8. CORMODE, G. AND MUTHUKRISHNAN, S. 2005. An improved data stream summary: The count-min sketch and its applications. J. Alg. 55, 1, 58-75.
9. FRAKES, B. AND YATES, R. 1992. Information Retrieval Data Structures and Algorithms. Prentice-Hall, Upper Saddle River, NJ.
10. GRAVANO, L., IPEIROTIS, P. G., JAGADISH, H. V., KOUDAS, N., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2001. Approximate string joins in a database (almost) for free. In Proceedings of the International Conference on Very Large Databases (VLDB). 491-500.
11. HODGE, V. J. AND AUSTIN, J. 2003. A comparison of standard spell checking algorithms and a novel binary neural approach. IEEE Trans. Knowl. Data Eng. 15, 5, 1073-1081.
12. JAGADISH, H. V., KAPITSKAIA, O., NG, R. T., AND SRIVASTAVA, D. 2000. One-Dimensional and multi-dimensional substring selectivity estimation. VLDB J. 9, 3, 214-230.
13. JAGADISH, H. V., KOUDAS, N., MUTHUKRISHNAN, S., POOSALA, V., SEVCIK, K. C., AND SUEL, T. 1998. Optimal histograms with quality guarantees. In Proceedings of the International Conference on Very Large Databases (VLDB). 275-286.
14. JAIN, A. AND DUBES, R. 1988. Algorithms for Clustering Data. Prentice-Hall, Upper Saddle River, NJ.
15. JAIN, A. K., MURTY, M. N., AND FLYNN, P. J. 1999. Data clustering: A review. ACM Comput. Surv. 31, 3, 264-323.
16. JIN, L., KOUDAS, N., LI, C., AND TUNG, A. K. H. 2005. Indexing mixed types for approximate retrieval. In Proceedings of the International Conference on Very Large Databases (VLDB). 793-804.
17. JIN, L. AND LI, C. 2005. Selectivity estimation for fuzzy string predicates in large data sets. In Proceedings of the International Conference on Very Large Databases (VLDB). 397-408.
18. JIN, L., LI, C., AND MEHROTRA, S. 2003. Efficient record linkage in large data sets. In Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA). 137.
19. KRISHNAN, P., VITTER, J. S., AND IYER, B. 1996. Estimating alphanumeric selectivity in the presence of wildcards. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 282-293.
20. KUKICH, K. 1992. Technique for automatically correcting words in text. ACM Comput. Surv. 24, 4, 377-439.
21. MATIAS, Y., VITTER, J. S., AND WANG, M. 1998. Wavelet-based histograms for selectivity estimation. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 448-459.
22. MATIAS, Y., VITTER, J. S., AND WANG, M. 2000. Dynamic maintenance of wavelet-based histograms. VLDB J. 101-110.
23. MAZEIKA, A. AND BÖHLEN, M. H. 2006. Cleansing databases of misspelled proper nouns. In Proceedings of the CleanDB Workshop (in conjunction with) the International Conference on Very Large Databases (VLDB).
24. MURALIKRISHNA, M. AND DEWITT, D. J. 1988. Equi-Depth histograms for estimating selectivity factors for multi-dimensional queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 28-36.
25. NAVARRO, G. 2001. A guided tour to approximate string matching. ACM Comput. Surv. 33, 1, 31-88.
26. POOSALA, V., HAAS, P. J., IOANNIDIS, Y E., AND SHEKITA, E. J. 1996. Improved histograms for selectivity estimation of range predicates. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 294-305.
27. SAHINALP, C., TASAN, M., MACKER, J., AND OZSOYOGLU, Z. M. 2003. Distance based indexing for string proximity search. In Proceedings of the International Conference on Data Engineering (ICDE). 125-137.
28. SALTON, G. AND MCGILL, M. J. 1986. Introduction to Modern Information Retrieval. McGraw-Hill, New York.
29. SHEU, S., CHENG, C.-Y., AND CHANG, A. 2005. Fast pattern detection in stream data. In Proceedings of the Conference on Advanced Information Networking and Applications (AINA). 125-130.
30. UKKONEN, E. 1983. On approximate string matching. In Proceedings of the Conference on Foundations of Computation Theory (FCT).
31. VERNICA, R. AND LI, C. 2007. Flamingo project. http://www.ics.uci.edu/~flamingo/.