Acta Scientific Computer Sciences (ASCS)

Review Article Volume 2 Issue 4

MatBase Metadata Catalog Management

Christian Mancas*

Mathematics and Computer Science Department, Ovidius University, Constanta, Romania

*Corresponding Author: Christian Mancas, Mathematics and Computer Science Department, Ovidius University, Constanta, Romania.

Received: March 20, 2020; Published: March 31, 2020

×

Abstract

  MatBase is a prototype intelligent 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 of constraint types: 61, partitioned into three categories (set, containing 16 types, mapping, containing 44 types, and object) and eight subcategories (general set, dyadic relation, general mapping, autofunction, general function product, homogeneous binary function product, function diagram, and object). 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, a sine qua non condition of data quality. This mathematical data model also includes Datalog, thus making MatBase also a deductive, so a knowledge base system. Currently, there are two MatBase versions (one developed in MS Access and the other in MS.NET, using C# and SQL Server), used both by two software developing companies and during labs of our M.Sc. students within the Advanced Databases lectures and labs, both at the Ovidius University and at the Department of Engineering in Foreign Languages, Computer Science Taught in English Stream of the Bucharest Polytechnic University. This paper presents MatBase’s metadata catalog and its management.

Keywords: Metadata and Data Quality; Semantic Approaches; Metadata Management; Metadata for Business Process Modeling; Data Structures and Algorithms for Data Management; DBMS Engine Architectures; (Elementary) Mathematical Data Model; Mat- Base

×

References

  1. Mancas C and Dragomir S. “MatBase Datalog Subsystem Metacatalog Conceptual Design”. In: Proceedings IASTED DBA 2004 Conference on Software Eng and App (2004): 34-41.
  2. Mancas C. “Conceptual Data Modeling and Database Design: A Completely Algorithmic Approach”. Volume I: The Shortest Advisable Path”. Apple Academic Press/CRC Press (Taylor and Francis Group: Waretown, NJ (2015).
  3. Mancas C. “Mat Base - a Tool for Transparent Programming while Modelling Data at Conceptual Levels”. In: Proceedings 5th International Conference on Computer Science, Information Technology CSITEC (2019): 15-27.
  4. 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 and Francis Group: Waretown, NJ (2020).
  5. Mancas C., et al. “On Modeling First Order Predicate Calculus Using the Elementary Mathematical Data Model in Mat Base DBMS”. In: Proceedings 21st IASTED International Conference on Applied Informatics (2003): 1197-1202.
  6. Abiteboul S., et al. “Foundations of Databases”. Addison-Wesley, Reading, MA (1995).
  7. Codd EF. “A relational model for large shared data banks”. CACM6 (1970): 377-387.
  8. Chen PP. “The entity-relationship model: Toward a unified view of data”. ACM Transactions on Database Systems1 (1976): 9-36.
  9. Thalheim B. “Fundamentals of Entity-Relationship Modeling”. Springer-Verlag, Berlin (2000).
  10. Mancas C. “A Deeper Insight into the Mathematical Data Model”. In: Proceedings 13th ISDBMS International Seminar on DBMS (1990): 122-134.
  11. Mancas C. “On knowledge representation using an Elementary Mathematical Data Model”. In: Proceedings 1st IASTED International Conference on Information and Knowledge Sharing (2002): 206-211.
  12. Mancas C. “On Modeling Closed E-R Diagrams Using an Elementary Mathematical Data Model”. In: Proceedings 6th ADBIS Conference on Advances in DB and Inf. Syst (2002): 65-74.
  13. Mancas C. “Mat Base Constraint Sets Coherence and Minimality Enforcement Algorithms”. In: Benczur, A., Thalheim, B., Horvath, T. (eds.: Proceedings 22nd ADBIS Conference on Advances in DB and Inf. Sys (2018): 263-277.
  14. Mancas C. “Mat Base E-RD Cycles Associated Non-Relational Constraints Discovery Assistance Algorithm”. In: Intelligent Computing, Proc. Computing Conference, AISC Series 997.1 (2019): 390-409.
  15. Berkus J. “Josh’s Rules (of Database Contracting)” (2007).
  16. Mancas C and Dorobantu V. “On enforcing relational constraints in Mat Base”. London Journal of Research in Computer Science and Technology 17.1 (2017): 39-45.
  17. Kueker DW. “Mathematical Logic and Theoretical Computer Science”. (In: Lecture Notes in Pure and Applied Mathematics Series). CRC Press, Boca Raton, FL (1986).
  18. Mancas C and Mocanu A. “Mat Base DFS Detecting and Classifying E-RD Cycles Algorithm”. Journal of Computer Science Applications and Information Technology4 (2017): 1-14.
  19. Mancas C. “Algorithms for key discovery assistance”. In: Proceedings 15th International Conference on Perspectives in Business Informatics Research (BIR 2016): LNBIP 261 (2016): 322-338.
×

Citation

Citation: Christian Mancas. “MatBase Metadata Catalog Management”. Acta Scientific Computer Sciences 2.4 (2020): 25-29.




Member In



News and Events


  • Certification for Review
    Acta Scientific certifies the Editors/reviewers for their review done towards the assigned articles of the respective journals.
  • Submission Timeline for Upcoming Issue
    The last date for submission of articles for regular Issues is July 15, 2020.
  • Publication Certificate
    Authors will be issued a "Publication Certificate" as a mark of appreciation for publishing their work.
  • Best Article of the Issue
    The Editors will elect one Best Article after each issue release. The authors of this article will be provided with a certificate of “Best Article of the Issue”.
  • Welcoming Article Submission
    Acta Scientific delightfully welcomes active researchers for submission of articles towards the upcoming issue of respective journals.
  • Contact US