Skip to main content
SpringerLink
Log in

MatBase Constraint Sets Coherence and Minimality Enforcement Algorithms

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2018)

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

Included in the following conference series:

  • 724 Accesses

Abstract

MatBase is a prototype data and knowledge base management system based on the Relational, Entity-Relationship, and (Elementary) Mathematical Data Models. The latter distinguishes itself especially by its rich panoply made of 70 constraint types. They provide database and software application designers with the tools necessary for capturing and enforcing all business rules from any sub-universe of discourse, thus guaranteeing database instances plausibility. When dealing with such a wealth of constraint types, both incoherencies and redundancies are possible. As only coherent constraint sets are acceptable and minimal ones are desirable, this paper proposes as fast as possible table-driven algorithms for assisting enforcement of coherence and guaranteeing minimality of such constraint sets, which are implemented in the current MatBase versions. The paper also discusses their complexity and utility, both in the study of sets, functions, and relations semi-naïve algebra and first order predicate calculus with equality, as well as, especially, in data modeling, database constraint theory, advanced database management systems, database design, and database software application development.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Berkus, J.: Josh’s Rules (of Database Contracting) (2007). http://it.toolbox.com/blogs/database-soup/joshs-rules-of-database-contracting-17253

  3. Chen, P.P.: The entity-relationship model: toward a unified view of data. ACM Trans. Database Syst. 1(1), 9–36 (1976)

    Article  MathSciNet  Google Scholar 

  4. Codd, E.F.: A relational model for large shared data banks. Commun. ACM 13(6), 377–387 (1970)

    Article  Google Scholar 

  5. Kueker, D.W.: Mathematical Logic and Theoretical Computer Science. Lecture Notes in Pure and Applied Mathematics Series. CRC Press, Boca Raton (1986)

    Google Scholar 

  6. Mancas, C.: A deeper insight into the mathematical data model. In: Proceedings of the 13th ISDBMS International Seminar on DBMS, pp. 122–134. ICI Bucharest, Romania (1990)

    Google Scholar 

  7. Mancas, C.: On knowledge representation using an Elementary Mathematical Data Model. In: Proceedings of the 1st IASTED International Conference on Information and Knowledge Sharing (IKS 2002), pp. 206–211. Acta Press, Calgary (2002)

    Google Scholar 

  8. Mancas, C.: On modeling closed E-R diagrams using an elementary mathematical data model. In: Proceedings of the 6th ADBIS Conference on Advances in DB and Information Systems, pp. 65–74. Slovak Technology University Press, Bratislava (2002)

    Google Scholar 

  9. Mancas, C.: On the equivalence between entity-relationship and functional data modelling. In Proceedings of the 7th IASTED International Conference on Software Engineering and Applications (SEA 2003), pp. 335–340. Acta Press, Calgary (2003)

    Google Scholar 

  10. Mancas, C.: Conceptual Data Modeling and Database Design A Completely Algorithmic Approach. Volume I: The Shortest Advisable Path. Apple Academic Press/CRC Press (Taylor & Francis Group), Waretown (2015)

    Book  Google Scholar 

  11. Mancas, C.: Conceptual Data Modeling and Database Design: A Completely Algorithmic Approach. Volume II: Refinements for an Expert Path. Apple Academic Press/CRC Press (Taylor & Francis Group), Waretown (2019, in press)

    Google Scholar 

  12. Mancas, C., Dorobantu, V.: On enforcing relational constraints in MatBase. Lond. J. Res. Comput. Sci. Technol. 17(1), 39–45 (2017)

    Google Scholar 

  13. Mancas, C., Dragomir, S., Crasovschi, L.: On modeling first order predicate calculus using the elementary mathematical data model in MatBase DBMS. In: Proceedings of the 21st IASTED International Conference on Applied Informatics (AI 2003), pp. 1197–1202. Acta Press, Calgary (2003)

    Google Scholar 

  14. Shoenfield, J.R.: Mathematical Logic. A K Peters/CRC Press (Taylor & Francis Group), Boca Raton/Waretown (2001)

    MATH  Google Scholar 

  15. Sun, X.H., Kamel, N., Ni, L.: Solving implication problems in database applications. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 185–192. ACM, New York (1989)

    Google Scholar 

  16. Thalheim, B.: Fundamentals of Entity-Relationship Modeling. Springer, Berlin (2000)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Computer Science Department, Ovidius University, Constanța, Romania

    Christian Mancas

Authors
  1. Christian Mancas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Mancas .

Editor information

Editors and Affiliations

  1. Eötvös Loránd University, Budapest, Hungary

    András Benczúr

  2. Christian-Albrechts-Universität, Kiel, Germany

    Bernhard Thalheim

  3. Eötvös Loránd University, Budapest, Hungary

    Tomáš Horváth

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mancas, C. (2018). MatBase Constraint Sets Coherence and Minimality Enforcement Algorithms. In: Benczúr, A., Thalheim, B., Horváth, T. (eds) Advances in Databases and Information Systems. ADBIS 2018. Lecture Notes in Computer Science(), vol 11019. Springer, Cham. https://doi.org/10.1007/978-3-319-98398-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98398-1_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98397-4

  • Online ISBN: 978-3-319-98398-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation