Mining violations to relax relational database constraints

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Mazuran, M., Quintarelli, E., Rossato, R., & Tanca, L. (2009). Mining violations to relax relational database constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5691 LNCS, pp. 339–353). https://doi.org/10.1007/978-3-642-03730-6_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free