An efficient filter for approximate membership checking

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 805-817

  Chakrabarti, Kaushik ^a   Chaudhuri, Surajit ^a   Ganti, Venkatesh ^a   Xin, Dong ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Approximate membership checking; Filtering; String match

Indexed keywords

APPROXIMATE MEMBERSHIP CHECKING; BIOMEDICAL LITERATURES; COMPUTATION TIMES; FALSE NEGATIVES; FILTER STRUCTURES; FILTERING; NAMED ENTITIES; REAL DATA SETS; STRING MATCH; TEXT DOCUMENTS; TEXT STRINGS; VERIFICATION FRAMEWORKS;

WAVE FILTERS;

EID: 57149127665     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376697     Document Type: Conference Paper

References (20)

1. A. V. Aho and M. J. Corasick. Efficient string matching: An aid to bibliographic search. Commun. ACM, 18(6):333-340, 1975.
2. A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh. Text indexing and dictionary matching with one error. J. Algorithms, 37(2):309-325, 2000.
3. A. Arasu, V. Ganti, and R. Kaushik, Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
4. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
5. G. S. Brodal and L. Gasieniec. Approximate dictionary queries. In CPM, pages 65-74, 1996.
6. K. Chakrabarti, V. Ganti, J. Han, and D. Xin. Ranking objects based on relationships. In SIGMOD Conference, pages 371-382, 2006.
7. A. Chandel, P. C. Nagesh, and S. Sarawagi. Efficient batch top-k search for dictionary-based entity recognition. In ICDE, page 28, 2006.
8. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, page 5, 2006.
9. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. In ICDE, pages 489-499, 2000.
10. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
11. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518-529, 1999.
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 VLDB, pages 491-500, 2001.
13. T. H. Haveliwala, A. Gionis, and P. Indyk. Scalable techniques for clustering the web. In WebDB (Informal Proceedings), pages 129-134, 2000.
14. U. Manber and S. Wu. An algorithm for approximate membership checking with application to password security. Inf. Process. Lett., 50(4):191-197, 1994.
15. M. Narayanan and R. M. Karp. Gapped local similarity search with provable guarantees. In WABI, pages 74-86, 2004.
16. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD Conference, pages 743-754, 2004.
17. A. Singhal. Modern information retrieval: A brief overview. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 24(4):35-43, 2001.
18. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 1999.
19. A. C.-C. Yao and F. F. Yao. Dictionary loop-up with small errors. In CPM, pages 387-394, 1995.
20. X. Zhou, X. Zhang, and X. Hu. Maxmatcher: Biological concept extraction using approximate dictionary lookup. In PRICAI, pages 1145-1149, 2006.