Skip to main content

Mining Violations to Relax Relational Database Constraints

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5691))

Included in the following conference series:

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.

This research is partially supported by the Italian MIUR project ARTDECO and by the European Commission, Programme IDEAS-ERC, Project 227977-SMScom.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abe, N., Zadrozny, B., Langford, J.: Outlier detection by active learning. In: Proceedings of Int. Conf. on Knowledge Discovery and Data Mining (KDD 2006), pp. 504–509 (2006)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th Int. Conf. on Very Large Data Bases (VLDB 1994), pp. 487–499. Morgan Kaufmann Publishers Inc, San Francisco (1994)

    Google Scholar 

  3. Angiulli, F., Greco, G., Palopoli, L.: Outlier detection by logic programming. ACM Transaction on Computational Logic (to appear)(2006)

    Google Scholar 

  4. Angiulli, F., Pizzuti, C.: Outlier mining in large high dimensional datasets. IEEE Transactions on Knowledge and Data Engineering 17(2), 203–215 (2005)

    Article  MATH  Google Scholar 

  5. Apiletti, D., Bruno, G., Ficarra, E., Baralis, E.: Data Cleaning and Semantic Improvement in Biological Databases. Journal of Integrative Bioinformatics, 3(2) (2006)

    Google Scholar 

  6. Bertossi, L.E., Chomicki, J.: Query answering in inconsistent databases. In: Chomicki, J., van der Meyden, R., Saake, G. (eds.) Logics for Emerging Applications of Databases, pp. 43–83. Springer, Heidelberg (2003)

    Google Scholar 

  7. Bruno, G., Garza, P., Quintarelli, E., Rossato, R.: Anomaly detection through quasi-functional dependency analysis. Special Issue of Journal of Digital Information Management Advances in Querying Non-Conventional Data Sources 5(4), 191–200 (2007)

    Google Scholar 

  8. Ceri, S., Giunta, F.D., Lanzi, P.: Mining Constraint Violations. ACM Transactions on Database Systems 32(1), 1–32 (2007)

    Article  Google Scholar 

  9. Ceri, S., Widom, J.: Deriving production rules for constraint maintainance. In: Proceedings of the 16th Int. Conf. on Very Large Data Bases, pp. 566–577. Morgan Kaufmann, San Francisco (1990)

    Google Scholar 

  10. Chomicki, J.: Consistent query answering: Opportunities and limitations. In: Bressan, S., Küng, J., Wagner, R. (eds.) DEXA 2006. LNCS, vol. 4080, pp. 527–531. Springer, Heidelberg (2006)

    Google Scholar 

  11. Chomicki, J.: Consistent query answering: Five easy pieces. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 1–17. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information and Computation 197(1-2), 90–121 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Cugola, G., Nitto, E.D., Fuggetta, A., Ghezzi, C.: A framework for formalizing inconsistencies and deviations in human-centered systems. ACM Trans. Softw. Eng. Methodol. 5(3), 191–230 (1996)

    Article  Google Scholar 

  14. Flesca, S., Furfaro, F., Greco, S., Zumpano, E.: Querying and repairing inconsistent xml data. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, J.-Y., Sheng, Q.Z. (eds.) WISE 2005. LNCS, vol. 3806, pp. 175–188. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Flesca, S., Furfaro, F., Parisi, F.: Consistent query answers on numerical databases under aggregate constraints. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 279–294. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Greco, S., Sirangelo, C., Trubitsyna, I., Zumpano, E.: Preferred repairs for inconsistent databases. In: Proceedings of Int. Conf. on Database and Expert System Application, pp. 44–55 (2004)

    Google Scholar 

  17. Kanellakis, P.C.: Elements of relational database theory. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 1073–1156. Brown University (1990)

    Google Scholar 

  18. Mazuran, M., Quintarelli, E., Rossato, R., Tanca, L.: Mining violations to relax relational database constraints. Technical report, Politecnico di Milano (2009), http://home.dei.polimi.it/quintare/Papers/MQT09Constraint-RR.pdf

  19. Murata, T., Borgida, A.: Handling of irregularities in human centered systems: A unified framework for data and processes. IEEE Transaction on Software Engineering 26(10) (2000)

    Google Scholar 

  20. Staworko, S., Chomicki, J., Marcinkowski, J.: Priority-based conflict resolution in inconsistent relational databases. In: EDBT Workshops (IIDB). Springer, Heidelberg (2006)

    Google Scholar 

  21. TPC-H. The TPC benchmark H. Transaction Processing Performance Council (2005), http://www.tpc.org/tpch/default.asp

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mazuran, M., Quintarelli, E., Rossato, R., Tanca, L. (2009). Mining Violations to Relax Relational Database Constraints. In: Pedersen, T.B., Mohania, M.K., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2009. Lecture Notes in Computer Science, vol 5691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03730-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03730-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03729-0

  • Online ISBN: 978-3-642-03730-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics