A graph theoretic approach to key equivalence

Authors:
J. Horacio Camacho;Abdellah Salhi;Qingfu Zhang
Affiliations:
University of Essex, Colchester, UK;University of Essex, Colchester, UK;University of Essex, Colchester, UK
Venue:
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Year:
2005

Citing 3
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
The merge/purge problem for large databases

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Hardening soft information sources

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

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 Cohen et 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.