Part of the book series:Lecture Notes in Computer Science ((LNAI,volume 3789))
Included in the following conference series:
Abstract
This paper is concerned with redundancy detection and elimination in databases via the solution of a key equivalence problem. The approach is related to the hardening of soft databases method due to Cohenet al., [4]. Here, the problem is described in graph theoretic terms. An appropriate optimization model is drawn and solved indirectly. This approach is shown to be effective. Computational results on test databases are included.
This is a preview of subscription content,log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Newcombe, H.B., Kennedy, J.M., Axford, S.J., James, A.P.: Automatic linkage of vital records. Science 130, 954–959 (1959)
Hernandez, M.A., Stolfo, S.J.: The merge/purge problem for large databases. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD 1995), San Jose, CA, May 1995, pp. 127–138 (1995)
Monge, A.E., Elkan, C.P.: An efficient domain-independent algorithm for detecting approximately duplicate database records. In: Proceedings of the SIGMOD 1997 Workshop on Research Issues on Data Mining and Knowledge Discovery, Tuscon, AZ, May 1997, pp. 23–29 (1997)
Cohen, W.W., Kautz, H., McAllester, D.: Hardening soft information sources. In: Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (KDD 2000), Boston, MA (August 2000)
Pu, C.: Key Equivalence in Heterogeneous Databases, Department of Computer Science, Columbia University, New York, NY (1991)
Cohen, W.W., Ravikumar, P., Stephen, E., Fienberg, A.: Comparison of String Distance Metrics for Name-Matching Tasks (2003)
Jaro, M.A.: Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida. Journal of the American Statistical Association 89, 414–420 (1989)
Nemhauser, Wolsey: Integer and Combinatorial Optimization. Willey Interscience, Hoboken (1988)
Author information
Authors and Affiliations
University of Essex, Colchester, CO43SQ, UK
J. Horacio Camacho, Abdellah Salhi & Qingfu Zhang
- J. Horacio Camacho
You can also search for this author inPubMed Google Scholar
- Abdellah Salhi
You can also search for this author inPubMed Google Scholar
- Qingfu Zhang
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
National Polytechnic Institute, Center for Computing Research, 07738, Mexico City, México
Alexander Gelbukh
Technológico de Monterrey (ITESM), Campus Ciudad de México (CCM), Calle del Puente 222, Col. Ejudos de Huipulco, 14360 DF, Tlalpan, Mexico
Álvaro de Albornoz
Center for Intelligent Systems, Tecnológico de Monterrey, Campus Monterrey, 64849, Monterrey, N.L., Mexico
Hugo Terashima-Marín
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Camacho, J.H., Salhi, A., Zhang, Q. (2005). A Graph Theoretic Approach to Key Equivalence. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_53
Download citation
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-540-29896-0
Online ISBN:978-3-540-31653-4
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative