Bed-tree: An all-purpose index structure for string similarity search based on edit distance

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 915-926

  Zhang, Zhenjie ^a   Hadjieleftheriou, Marios ^b   Ooi, Beng Chin ^a   Srivastava, Divesh ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

approximate join; edit distance; range query; similarity search; string; top k query

Indexed keywords

BIOLOGICAL SEQUENCE ANALYSIS; COMPLETE SOLUTIONS; COMPUTER SCIENTISTS; DATA UPDATE; DISSIMILARITY MEASURES; EDIT DISTANCE; FAST RESPONSE TIME; FUNDAMENTAL PROBLEM; INDEX STRUCTURE; INDEXING TECHNIQUES; INVERTED LIST; MEMORY CONSTRAINTS; NORMALIZED EDIT DISTANCE; QUERY TYPES; RANGE QUERY; RESEARCH EFFORTS; SEARCH PROCESS; SIMILARITY MEASURE; SIMILARITY QUERY; SIMILARITY SEARCH; STATE-OF-THE-ART METHODS; STRING PROCESSING; STRING SIMILARITY; TOP-K QUERY; TREE-BASED; WIDE SPECTRUM;

INDUSTRIAL RESEARCH; NETWORK SECURITY;

INFORMATION RETRIEVAL;

EID: 77954747181     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807266     Document Type: Conference Paper

References (21)

1. A. Andoni and K. Onak. Approximating edit distance in near-linear time. In STOC, pages 199-204, 2009.
2. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
3. R. J. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, pages 131-140, 2007.
4. A. Behm, S. Ji, C. Li, and J. Lu. Space-constrained gram-based indexing for efficient approximate string search. In ICDE, pages 604-615, 2009.
5. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, pages 313-324, 2003.
6. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, pages 5-15, 2006.
7. S. Chaudhuri and R. Kaushik. Extending autocompletion to tolerate errors. In SIGMOD, pages 707-718, 2009.
8. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press and McGraw-Hill, 2001.
10. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Transactions on Algorithms, 3(1), 2007.
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. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In ICDE, pages 267-276, 2008.
13. M. Hadjieleftheriou, N. Koudas, and D. Srivastava. Incremental maintenance of length normalized indexes for approximate string matching. In SIGMOD, pages 429-440, 2009.
14. S. Ji, G. Li, C. Li, and J. Feng. Efficient interactive fuzzy keyword search. In WWW, pages 371-380, 2009.
15. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, pages 257-266, 2008.
16. W. J. Masek and M. Paterson. A faster algorithm computing string edit distances. Journal of Computer and System Sciences, 20(1):18-31, 1980.
17. R. Ostrovsky and Y. Rabani. Low distortion embeddings for edit distance. Journal of the ACM, 54(5):23-36, 2007.
18. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD, pages 743-754, 2004.
19. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, 1974.
20. C. Xiao, W. Wang, and X. Lin. Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB, 1(1):933-944, 2008.
21. C. Xiao, W. Wang, X. Lin, and H. Shang. Top-k set similarity joins. In ICDE, pages 916-927, 2009.