Conference Paper

A Graph Theoretic Approach to Key Equivalence

DOI: 10.1007/11579427_53 Conference: MICAI 2005: Advances in Artificial Intelligence, 4th Mexican International Conference on Artificial Intelligence, Monterrey, Mexico, November 14-18, 2005, Proceedings
Source: DBLP


This paper is concerned with redundancy detection and elim- ination in databases via the solution of a key equivalence problem. The approach is related to the hardening of soft databases method due to Co- hen et al., (4). Here, the problem is described in graph theoretic terms. An appropriate optimization model is drawn and solved indirectly. This ap- proach is shown to be effective. Computational results on test databases are included.

Download full-text


Available from: Abdel Salhi,
  • Source
    • "The set of constraints suggested here addresses the problem of not well behaved string metrics, since some of those constraints depend on each of the trees included in the M SF and not exclusively on a global threshold parameter k. For instance, the results to be shown in Section 7 show that, in some cases, the suggested unsupervised approach outperforms the supervised approach suggested in [Camacho and Salhi 2005] "