Mining Violations to Relax Relational Database Constraints

Frequent constraint violations on the data stored in a database may suggest that the represented reality is changing, and thus the database does not reflect it anymore. It is thus desirable to devise methods and tools to support (semi-)automatic schema changes, in order for the schema to mirror the new situation. In this work we propose a methodology and the RELACS tool, based on data mining, to maintain the domain and tuple integrity constraints specified at design time, in order to adjust them to the evolutions of the modeled reality that may occur during the database life. The approach we propose allows to isolate frequent and meaningful constraint violations and, consequently, to extract novel rules that can be used to update or relax the no longer up-to-date integrity constraints.

[1]  Richard T. Snodgrass,et al.  Editorial: Single- versus double-blind reviewing , 2007, TODS.

[2]  Alfredo Cuzzocrea Advances in Querying Non-Conventional Data Sources , 2007, J. Digit. Inf. Manag..

[3]  Sebastian Maneth,et al.  Efficient Memory Representation of XML Documents , 2005, DBPL.

[4]  Sergio Greco,et al.  Preferred repairs for inconsistent databases , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

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

[6]  Giulia Bruno,et al.  Anomaly detection through quasi-functional dependency analysis , 2007, J. Digit. Inf. Manag..

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

[8]  Gunter Saake,et al.  Logics for Emerging Applications of Databases , 2003, Springer Berlin Heidelberg.

[9]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

[10]  Pier Luca Lanzi,et al.  Mining constraint violations , 2007, TODS.

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

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

[13]  Jan Chomicki,et al.  Invited Paper: Consistent Query Answering: Opportunities and Limitations , 2006, 17th International Workshop on Database and Expert Systems Applications (DEXA'06).

[14]  Elena Baralis,et al.  Data Cleaning and Semantic Improvement in Biological Databases , 2006, J. Integr. Bioinform..

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

[16]  Jennifer Widom,et al.  Deriving Production Rules for Constraint Maintainance , 1990, VLDB.

[17]  Jan Chomicki,et al.  Priority-Based Conflict Resolution in Inconsistent Relational Databases , 2005, ArXiv.

[18]  Bianca Zadrozny,et al.  Outlier detection by active learning , 2006, KDD '06.

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

[20]  Helmut Seidl,et al.  Exact XML Type Checking in Polynomial Time , 2007, ICDT.

[21]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[22]  Clara Pizzuti,et al.  Outlier mining in large high-dimensional data sets , 2005, IEEE Transactions on Knowledge and Data Engineering.

[23]  Luigi Palopoli,et al.  Outlier detection by logic programming , 2004, TOCL.

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

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

[26]  Sergio Greco,et al.  Feasibility Conditions and Preference Criteria in Querying and Repairing Inconsistent Databases , 2004, DEXA.

[27]  Anne H. H Ngu,et al.  Web Information Systems Engineering - WISE 2005, 6th International Conference on Web Information Systems Engineering, New York, NY, USA, November 20-22, 2005, Proceedings , 2005, WISE.

[28]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.