Indexing mixed types for approximate retrieval

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

Volumn 2, Issue , 2005, Pages 793-804

  Jin, Liang ^a   Li, Chen ^a   Koudas, Nick ^b   Tung, Anthony K H ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; INDEXING (OF INFORMATION); NUMERICAL ANALYSIS; PROBLEM SOLVING; QUERY LANGUAGES;

INDEX STRUCTURE; NUMERIC ATTRIBUTES; QUERY STRING;

INFORMATION RETRIEVAL;

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

References (24)

1. R. Anathakrishna, S. Chaudhuri, and V. Ganti. Eliminating Fuzzy Duplicates in Data Warehouses. VLDB, Aug. 2002.
2. A. Apostolico and Z. Galil. Pattern Matching Algorithms. Oxford University Press, 1992.
3. R. Baeza-Yates and G. Navarro. A practical index for text retrieval allowing errors, 1997.
4. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In The VLDB Journal, pages 426-435, 1997.
5. 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.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Presss, 1990.
7. V. Ganti, S. Chaudhuri, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. SIGMOD, June 2003.
8. H. Garhaldas, D. Florescu, D. Shasha, E. Simon, and E. Saita. Declarative Data Cleaning. Proceedings of VLDB, 2001.
9. L. Gravani, P. Ipeirotis, N. Koudas, and D. Srivastava. Approximate Text Joins and Their Integration into an RDBMS. Proceedings of WWW, 2002.
10. 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.
11. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, 1998.
12. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
13. M. Hernandez and S. Stolfo. The Merge Purge Problem for Large Databases. SIGMOD, pages 127-138, June 1995.
14. H. V. Jagadish, N. Koudas, and D. Srivastava. On Effective Multidimensional Indexing for Strings. SIGMOD, June 2001.
15. L. Jin, N. Koudas, C. Li, and A. K. Tung. Indexing mixed types for approximate retrieval (full version). Technical report, UC Irvine, Department of Computer Science, 2005.
16. L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In Proc. of VLDB, 2005.
17. 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.
18. 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.
19. E. W. Myers and W. Miller. Approximate matching of regular expressions. Bulletin of Mathematical Biology, pages 7-37, 1989.
20. V. Raman and J. M. Hellerstein. Potter's wheel: An interactive data cleaning system. In The VLDB Journal, pages 381-390, 2001.
21. 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.
22. S. Sarawagi. Special Issue on Data Cleaning. IEEE Data Engineering Bulletin, 23 (4), 2000.
23. S. Sarawagi and A. Bhamidipaty. Interactive Deduplication Using Active Learning. Proceedings of VLDB, 2002.
24. H. Shang and T. H. Merrett. Tries for Approximate String Matching. IEEE Trans. on Knowledge and Data Engineering, pages 540-7, 1996.