On Detecting and Enforcing the Non-Relational Constraints Associated to Dyadic Relations in MatBase

Updata:01-01-1970

Source:
By:Christian Mancas

DOI: https://doi.org/10.30564/jeisr.v2i2.2090

Abstract:

MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational, Entity-Relationship, and (Elementary) Mathematical Data Models. Dyadic relationships are quite common in data modeling. Besides their relational-type constraints, they often exhibit mathematical properties that are not covered by the Relational Data Model. This paper presents and discusses the MatBase algorithm that assists database designers in discovering all non-relational constraints associated to them, as well as its algorithm for enforcing them, thus providing a significantly higher degree of data quality. 

References:

[1]Abiteboul, S., Hull, R., Vianu, V. Foundations of Databases. Addison-Wesley, Reading, MA, 1995. [2]Chen, P. P. The entity-relationship model: Toward a unified view of data. ACM TODS, 1976, 1(1): 9-36. [3]Codd, E. F. A relational model for large shared data banks. CACM, 1970, 13(6): 377-387. [4]Gosnell, D., Broecheler, M. The Practitioner’s Guide to Graph Data: Applying Graph Thinking and Graph Technologies to Solve Complex Problems. O’Reilly Media, Inc. Sebastopol, CA, 2020. [5]Jech, T. Set Theory. Springer Monographs in Mathematics (Third Millennium ed.). Springer-Verlag, Berlin, New York, 2003. [6]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, NJ, 2015. [7] Mancas, C. On the paramount importance of database constraints. J. Inf. Tech. & Soft. Eng., 5(3):1-4. Henderson, NV, 2015. [8]Mancas, C. Algorithms for key discovery assistance. In: Repa, V., Bruckner, T. (eds). BIR 2016, LNBIP, Springer, Cham, 2016, 261: 322-338. [9] Mancas, C. On Database Relationships versus Mathematical Relations. Global Journal of Comp. Sci. and Techn.: Soft. and Data Eng., Framingham, MA, 2016, 16(1): 13-16. [10]Mancas, C. MatBase Constraint Sets Coherence and Minimality Enforcement Algorithms. In: Benczur, A., Thalheim, B., Horvath, T. (eds.), Proc. 22nd ADBIS Conf. on Advances in DB and Inf. Syst., LNCS 11019, Springer, Cham, 2018: 263-277. [11]Mancas, C. MatBase E-RD Cycles Associated Non-Relational Constraints Discovery Assistance Algorithm. In: Arai, K., Bhatia, R., Kapoor, S. (eds.), Intelligent Computing, Proc. 2019 Computing Conference, AISC Series, Springer, Cham, 2019, 997(1): 390-409. [12]Mancas, C. Matbase Autofunction Non-Relational Constraints Enforcement Algorithms. IJCSIT, 2019, 11(5): 63-76. [13]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, NJ, 2021, in press. [14]Rautenberg, W. A Concise Introduction to Mathematical Logic (3rd ed.). Springer Science+Business Media, NY, 2010. [15]Ross, R. G. Principles of the Business Rule Approach. Addison-Wesley Professional, Boston, MA, 2003. [16]Shinavier, J., Wisnesky, R. Algebraic property graphs. Tech. Rep. Cornell Univ., 2019. https://arxiv.org/pdf/1909.04881.pdf [17]Schultz, P., Wisnesky, R. Algebraic Data Integration. Expanded and corrected version of the paper published in J. Functional Programming, 27, E24, Cambridge Univ. Press, 2017. https://arxiv.org/pdf/1503.03571.pdf [18]Thalheim, B. Entity-Relationship Modeling: Foundations of Database Technology. Springer-Verlag, Berlin, 2000. [19] Thom, F., Abdennadher, S. Essentials of Constraint Programming. Springer-Verlag, Berlin, Germany, 2003.

Tags: