Semi-automatic support for evolving functional dependencies

During the life of a database, systematic and frequent violations of a given constraint may suggest that the represented reality is changing and thus the constraint should evolve with it. In this paper we propose a method and a tool to (i) nd the functional dependencies that are violated by the current data, and (ii) support their evolution when it is necessary to update them. The method relies on the use of condence , as a measure that is associated with each dependency and allows us to understand "how far" the dependency is from correctly describing the current data; and of goodness, as a measure of balance between the data satisfying the antecedent of the dependency and those satisfying its consequent. Our method compares favorably with literature that approaches the same problem in a dierent way, and performs eectively and eciently as shown by our tests on both real and synthetic databases.

[1]  Giuseppe Polese,et al.  Relaxed Functional Dependencies—A Survey of Approaches , 2016, IEEE Transactions on Knowledge and Data Engineering.

[2]  Jan Chomicki,et al.  Query Answering in Inconsistent Databases , 2003, Logics for Emerging Applications of Databases.

[3]  Paolo Papotti,et al.  Discovering Denial Constraints , 2013, Proc. VLDB Endow..

[4]  Pietro Sala,et al.  Mining Approximate Temporal Functional Dependencies Based on Pure Temporal Grouping , 2013, 2013 IEEE 13th International Conference on Data Mining Workshops.

[5]  Letizia Tanca,et al.  Mining Violations to Relax Relational Database Constraints , 2009, DaWaK.

[6]  Renée J. Miller,et al.  A unified model for data and constraint repair , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[7]  Hiroki Nakayama,et al.  Formalization and Discovery of Approximate Conditional Functional Dependencies , 2013, DEXA.

[8]  M. Meilă Comparing clusterings---an information based distance , 2007 .

[9]  Alexander Borgida,et al.  Handling of Irregularities in Human Centered Systems: A Unified Framework for Data and Processes , 2000, IEEE Trans. Software Eng..

[10]  Fei Chiang,et al.  CONDOR: A System for CONstraint DiscOvery and Repair , 2014, CIKM.

[11]  Filippo Furfaro,et al.  Consistent Query Answers on Numerical Databases Under Aggregate Constraints , 2005, DBPL.

[12]  Jan Chomicki,et al.  Consistent Query Answering: Opportunities and Limitations ! , 2006 .

[13]  Edward L. Robertson,et al.  On approximation measures for functional dependencies , 2004, Inf. Syst..

[14]  Jan Chomicki,et al.  Consistent Query Answering: Five Easy Pieces , 2007, ICDT.

[15]  Jan Chomicki,et al.  Minimal-change integrity maintenance using tuple deletions , 2002, Inf. Comput..

[16]  Carlo Ghezzi,et al.  A framework for formalizing inconsistencies and deviations in human-centered systems , 1996, TSEM.

[17]  Jef Wijsen,et al.  Temporal Dependencies , 2009, Encyclopedia of Database Systems.

[18]  Chris Giannella,et al.  An Axiomatic Approach to Defining Approximation Measures for Functional Dependencies , 2002, ADBIS.

[19]  Sergio Greco,et al.  Querying and Repairing Inconsistent XML Data , 2005, WISE.

[20]  I. Good,et al.  Ergodic theory and information , 1966 .