Top-k set similarity joins

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 916-927

  Xiao, Chuan ^a   Wang, Wei ^a   Lin, Xuemin ^a   Shang, Haichuan ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA INTEGRATION; NEAR-DUPLICATES; PRIMITIVE OPERATIONS; REAL DATA SETS; SET SIMILARITY; SIMILARITY JOIN; SIMILARITY THRESHOLD; WEB PAGE;

DATA HANDLING;

PATTERN RECOGNITION;

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

References (36)

1. M. R. Henzinger, "Finding near-duplicate web pages: a large-scale evaluation of algorithms," in SIGIR, 2006.
2. W. W. Cohen, "Integration of heterogeneous databases without common domains using queries based on textual similarity," in SIGMOD Conference, 1998, pp. 201 -212.
3. W. E. Winkler, "The state of record linkage and current research problems," U.S. Bureau of the Census, Tech. Rep., 1999.
4. R. J. Bayardo, Y. Ma, and R. Srikant, "Scaling up all pairs similarity search," in WWW, 2007.
5. S. Chaudhuri, V. Ganti, and R. Kaushik, "A primitive operator for similarity joins in data cleaning," in ICDE, 2006.
6. C. Xiao, W. Wang, X. Lin, and J. X. Yu, "Efficient similarity joins for near duplicate detection," in WWW, 2008.
7. A. Arasu, V. Ganti, and R. Kaushik, "Efficient exact set-similarity joins," in VLDB, 2006.
8. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, "Closest pair queries in spatial databases," in SIGMOD Conference, 2000, pp. 189 -200.
9. A. Corral, M. Vassilakopoulos, and Y. Manolopoulos, "The impact of buffering on closest pairs queries using r-trees," in ADBIS, 2001, pp. 41 -54.
10. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, "Algorithms for processing k-closest-pair queries in spatial databases," Data Knowl. Eng., vol. 49, no. 1, pp. 67 -104, 2004.
11. R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, 1st ed. Addison Wesley, May 1999.
12. C. Li, B. Wang, and X. Yang, "VGRAM: Improving performance of approximate queries on string collections using variable-length grams," in VLDB, 2007.
13. H. Lee, R. T. Ng, and K. Shim, "Extending q-grams to estimate selectivity of string matching with low edit distance," in VLDB, 2007, pp. 195 -206.
14. M. A. Hernández and S. J. Stolfo, "Real-world data is dirty: Data cleansing and the merge/purge problem," Data Mining and Knowledge Discovery, vol. 2, no. 1, pp. 9 -37, 1998.
15. S. Sarawagi and A. Bhamidipaty, "Interactive deduplication using active learning," in KDD, 2002.
16. M. Bilenko, R. J. Mooney, W. W. Cohen, P. Ravikumar, and S. E. Fienberg, "Adaptive name matching in information integration," IEEE Intelligent Sys., vol. 18, no. 5, pp. 16 -23, 2003.
17. S. Sarawagi and A. Kirpal, "Efficient set joins on similarity predicates," in SIGMOD, 2004.
18. A. Arasu, S. Chaudhuri, and R. Kaushik, "Transformation-based framework for record matching," in ICDE, 2008, pp. 40 -49.
19. M. D. Lieberman, J. Sankaranarayanan, and H. Samet, "A fast similarity join algorithm using graphics processing units," in ICDE, 2008, pp. 1111 -1120.
20. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig, "Syntactic clustering of the web," Computer Networks, vol. 29, no. 8-13, pp. 1157 -1166, 1997.
21. A. Chowdhury, O. Frieder, D. A. Grossman, and M. C. McCabe, "Collection statistics for fast duplicate document detection," ACM Trans. Inf. Syst., vol. 20, no. 2, pp. 171 -191, 2002.
22. M. Charikar, "Similarity estimation techniques from rounding algorithms," in STOC, 2002.
23. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in VLDB, 1999.
24. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani, "Robust and efficient fuzzy match for online data cleaning," in SIGMOD Conference, 2003, pp. 313 -324.
25. 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.
26. C. Li, J. Lu, and Y. Lu, "Efficient merging and filtering algorithms for approximate string searches," in ICDE, 2008, pp. 257 -266.
27. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava, "Fast indexes and algorithms for set similarity selection queries," in ICDE, 2008, pp. 267 -276.
28. E. Ukkonen, "On approximate string matching," in FCT, 1983.
29. A. Z. Broder, "On the resemblance and containment of documents," in SEQS, 1997.
30. R. C. Russell, "Index, U.S. patent 1,261,167," April 1918.
31. R. Fagin, "Combining fuzzy information from multiple systems," J. Comput. Syst. Sci., vol. 58, no. 1, pp. 83 -99, 1999.
32. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," J. Comput. Syst. Sci., vol. 66, no. 4, pp. 614 -656, 2003.
33. S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis, "Automated ranking of database query results," in CIDR, 2003.
34. K. C.-C. Chang and S. won Hwang, "Minimal probing: supporting expensive predicates for top-k queries," in SIGMOD Conference, 2002, pp. 346 -357.
35. Y. Luo, X. Lin, W. Wang, and X. Zhou, "SPARK: top-k keyword query in relational databases," in SIGMOD Conference, 2007, pp. 115 -126.
36. M. Zhu, D. Papadias, J. Zhang, and D. L. Lee, "Top-k spatial joins," IEEE Trans. Knowl. Data Eng., vol. 17, no. 4, pp. 567 -579, 2005.