Incremental maintenance of length normalized indexes for approximate string matching

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 429-440

  Hadjieleftheriou, Marios ^a   Koudas, Nick ^b   Srivastava, Divesh ^a  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE STRING MATCHING; COMMON DENOMINATORS; DATA DEPENDENT; DOCUMENT RETRIEVAL; FALSE NEGATIVES; FALSE POSITIVE; GOOGLE MAPS; INCREMENTAL MAINTENANCE; INCREMENTAL UPDATES; INDEXING METHODS; INDEXING TECHNIQUES; KEY FEATURE; LOCAL SEARCH; NEW APPLICATIONS; REAL DATA SETS; SIMILARITY MEASURE; TIME INTERVAL;

INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; INFORMATION SERVICES; INTERNET; SEARCH ENGINES;

DATABASE SYSTEMS;

EID: 70849096574     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559891     Document Type: Conference Paper

References (22)

1. Apache Lucene. http://lucene.apache.org/.
2. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In Proc. of Very Large Data Bases (VLDB), pages 918-929, 2006.
3. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, May 1999.
4. R. A. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
5. A. Chandel, O. Hassanzadeh, N. Koudas, M. Sadoghi, and D. Srivastava. Benchmarking declarative approximate selection predicates. In Proc. of ACM Management of Data (SIGMOD), pages 353-364, 2007.
6. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, page 5, 2006.
7. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
8. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. IEEE Transactions on Knowledge and Data Engineering (TKDE), 19(1):1-16, 2007.
9. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proc. Of ACM Symposium on Principles of Database Systems (PODS), pages 102-113, 2001.
10. FAST - Enterprise Search. http://www.fastsearch.com.
11. Google. http://www.google.com.
12. 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 Proc. of Very Large Data Bases (VLDB), pages 491-500, 2001.
13. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In ICDE, 2008.
14. N. Koudas, A. Marathe, and D. Srivastava. Flexible string matching against large databases in practice. In Proc. of Very Large Data Bases (VLDB), pages 1078-1086, 2004.
15. N. Koudas, A. Marathe, and D. Srivastava. Propagating updates in SPIDER. In ICDE, pages 1146-1153, 2007.
16. N. Koudas, S. Sarawagi, and D. Srivastava. Record linkage: similarity measures and algorithms. In Proc. of ACM Management of Data (SIGMOD), pages 802-803, 2006.
17. M. Ley. DBLP database. http://dblp.uni-trier.de/xml.
18. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, pages 257-266, 2008.
19. Oracle. Oracle Berkeley DB. http://www.oracle.com/technology/products/ berkeley-db/db/index.html.
20. S. E. Robertson, S. Walker, M. Hancock-Beaulieu, A. Gull, and M. Lau. Okapi at TREC. In Text REtrieval Conference (TREC), pages 21-30, 1992.
21. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In Proc. of ACM Management of Data (SIGMOD), pages 743-754, 2004.
22. X. Yang, B. Wang, and C. Li. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In Proc. Of ACM Management of Data (SIGMOD), pages 353-364, 2008.