Reasoning about approximate match query results

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 8-

  Guha, Sudipto ^a   Koudas, Nick ^b   Srivastava, Divesh ^c   Yu, Xiaohui ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLEANING OPERATIONS; DECLARATIVE APPROXIMATE; MATCH QUERY;

ALGORITHMS; APPROXIMATION THEORY; DATA ACQUISITION; KNOWLEDGE ACQUISITION; PERFORMANCE;

DATABASE SYSTEMS;

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

References (18)

1. R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. VLDB, 2002.
2. S. Chaudhuri, R. Motwani, and V. Narasayya. On random sampling over joins. SIGMOD, 1999.
3. W. Cohen. Integration of heterogeneous databases without common domains using queries based on textual similarity. SIGMOD, 1998.
4. J. Copas and F. Hilton. Record linkage: Statistical models for matching computer records. Journal of the Royal Statistical Society, 1990.
5. T. Dasu, T. Johnson, S. Muthukrishnan, and V. Shkapenyuk. Mining database structure or how to build a data quality browser. SIGMOD, 2002.
6. I. P. Fellegi and A. B. Sunter. A theory for record linkage. Journal of the American Statistical Association, 64(328), pages 1183-1210, Dec. 1969.
7. H. Galhardas, D. Florescu, D. Shasha, E. Simon, and E. Saita. Declarative data cleaning: Language, model, and algorithms. VLDB, 2001.
8. S. Ganguly, P. Gibbons, Y. Mattias, and A. Silberschatz. Bifocal sampling for skew resistant join size estimation. SIGMOD, 1996.
9. V. Ganti, S. Chaudhuri, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. SIGMOD, 2003.
10. V. Ganti, S. Chaudhuri, and R. Motwani. Robust identification of fuzzy duplicates. ICDE, 2005.
11. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. VLDB, 2001.
12. L. Gravano, P. Ipeirotis, N. Koudas, and D. Srivastava. Text joins in an RDBMS for web data integration. WWW, 2003.
13. L. Gu, R. Baxter, D. Vickers, and C. Rainsford. Record linkage: Current practice and future directions. CMIS Technical Report N. 03/83, 2003.
14. D. Gusfield. Algorithms on strings, trees and sequences. Cambridge University Press, 1998.
15. M. Hernandez and S. Stolfo. The merge purge problem for large databases. SIGMOD, 1995.
16. N. Koudas, A. Marathe, and D. Srivastava. Flexible string matching against large databases in practice. VLDB, 2004.
17. N. Koudas, A. Marathe, and D. Srivastava. SPIDER: Flexible matching in databases. SIGMOD, 2005.
18. V. Poosala, Y. Ioannidis, P. Haas, and E. Shekita. Improved histograms for selectivity estimation of range predicates. SIGMOD, 1996.