Efficient merging and filtering algorithms for approximate string searches

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 257-266

  Li, Chen ^a   Lu, Jiaheng ^a   Lu, Yiming ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MERGING; TECHNOLOGY;

COSINE SIMILARITY; DATA CLEANING; DATA ENGINEERING; EDIT DISTANCES; FILTERING ALGORITHMS; FILTERING TECHNIQUES; INTERNATIONAL CONFERENCES; QUERY RELAXATION; QUERY STRINGS; REAL DATA SETS; REAL-TIME PERFORMANCE; SIMILARITY FUNCTIONS;

ALGORITHMS;

EID: 52649086729     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497434     Document Type: Conference Paper

References (14)

1. A. Arasu, V. Ganti, and R. Kaushik, "Efficient Exact Set-Similarity Joins," in VLDB, 2006, pp. 918-929.
2. R. Bayardo, Y. Ma, and R. Srikant, "Scaling up all-pairs similarity search," in WWW Conference, 2007.
3. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani, "Robust and Efficient Fuzzy Match for Online Data Cleaning," in SIGMOD, 2003, pp. 313-324.
4. 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, 2001, pp. 491-500.
5. C. Li, B. Wang, and X. Yang, "VGRAM: Improving performance of approximate queries on string collections using variable-length grams," in Very Large Data Bases, 2007.
6. E. Sutinen and J. Tarhio, "On Using q-Grams Locations in Approximate String Matching," in ESA, 1995, pp. 327-340.
7. E. Ukkonen, "Approximae String Matching with q-Grams and Maximal Matching," Theor. Comut. Sci., vol. 1, pp. 191-211, 1992.
8. V. Levenshtein, "Binary Codes Capable of Correcting Spurious Insertions and Deletions of Ones," Profi. Inf. Transmission, vol. 1, pp. 8-17, 1965.
9. S. Sarawagi and A. Kirpal, "Efficient set joins on similarity predicate," in ACM SIGMOD, 2004.
10. S. Chaudhuri, V. Ganti, and R. Kaushik, "A primitive operator for similarity joins in data cleaning," in ICDE, 2006, pp. 5-16.
11. G. Navarro, "A guided tour to approximate string matching," ACM Computing Surveys, vol. 33, no. 1, pp. 31-88, 2001.
12. K. Ramasamy, J. M. Patel, R. Kaushik, and J. F. Naughton, "Set containment joins: The good, the bad and the ugly," in VLDB, 2000.
13. N. Koudas, S. Sarawagi, and D. Srivastava, "Record linkage: similarity measures and algorithms," in SIGMOD Tutorial, 2005, pp. 802-803.
14. M.-S. Kim, K.-Y. Whang, J.-G. Lee, and M.-J. Lee, "n-Gram/2L: A space and time efficient two-level n-grara inverted index structure." in VLDB, 2005, pp. 325-336.