On Software Application Database Constraint-driven Design and Development

Authors

  • Christian Mancas Math. & Computer Science Department, Ovidius University, Constanta, 900720, Romania
  • Cristina Serban Math. & Computer Science Department, Ovidius University, Constanta, 900720, Romania
  • Diana Christina Mancas Math. & Computer Science Department, Ovidius University, Constanta, 900720, Romania

DOI:

https://doi.org/10.30564/jcsr.v5i1.5476

Abstract

This paper presents a methodology driven by database constraints for designing and developing (database) software applications. Much needed and with excellent results, this paradigm guarantees the highest possible quality of the managed data. The proposed methodology is illustrated with an easy to understand, yet complex medium-sized genealogy software application driven by more than 200 database constraints, which fully meets such expectations.

Keywords:

Database constraint-driven design and development, Database constraint, Data plausibility, Software architecture, Design and development, The (elementary) mathematical data model, MatBase

References

[1] Daylight, E.G., Niklaus, W., Hoare, T., et al., 2012. The dawn of software engineering: From Turing to Dijkstra. Lonely Scholar bvba: Belgium.

[2] Dijkstra, E.W., 1982. Selected writings on computing: A personal perspective. Springer Verlag: NY, Heidelberg, Berlin.

[3] Hoog, R. de, Jong, T. de, Vries, F. de, 1995. Constraint-driven software design: An escape from the waterfall model. 7(3), 48-63. DOI: https://doi.org/10.1111/j.1937-8327.1994.tb00637.x

[4] Hunt, A., Thomas, D., 1999. The pragmatic programmer: From journeyman to master. Addison-Wesley Professional: IL, USA.

[5] Evans, E., 2003. Domain-driven design: Tackling complexity in the heart of software. Addison-Wesley Professional: IL, USA.

[6] Taylor, R.N., Medvidovic, N., Dashofy, E.M., 2010. Software architecture: Foundations, theory, and practice. Wiley: NJ, USA.

[7] Vernon, V., 2016. Domain-driven design distilled. Addison-Wesley: IL, USA.

[8] Ousterhout, J., 2021. A Philosophy of Software Design, 2nd edition. Yaknyam Press: CA, USA.

[9] Mancas, D. C., 2023. Design and development of a DB software application for managing genealogical trees [Master's thesis]. Constanta, Romania: Ovidius University. p. 670.

[10] Lano, K., 2008. Constraint-driven development. Information and Software Technology. 50(5), 406-423. DOI: https://doi.org/10.1016/j.infsof.2007.04.003

[11] Demuth, A., Lopez-Herrejon, R.E., Egyed, A. (2012). Constraint-Driven Modeling through Transformation. In: Hu, Z., de Lara, J. (editors), Theory and Practice of Model Transformations. ICMT 2012. Lecture Notes in Computer Science. 7307, 248-263. DOI: https://doi.org/10.1007/978-3-642-30476-7_17

[12] Rebmann, A., Weidlich, M., Aa, H. van der (editors), 2022. GECCO: Constraint-driven abstraction of low-level event logs. 38th IEEE International Conference on Data Engineering; 2022 May 9-12; Kuala Lumpur, Malaysia. USA: IEEE. pp. 150-163. DOI: https://doi.org/10.1109/ICDE53745.2022.00016

[13] Siddiqui, J.H., 2012. Improving Systematic Constraint-driven Analysis using Incremental and Parallel Techniques [PhD thesis]. USA: University of Texas at Austin. [cited 2023 Feb 14]. Available from: https://repositories.lib.utexas.edu/bitstream/handle/2152/19568/siddiqui_dissertation_201221.pdf?sequence=1&isAllowed=y

[14] Shrotri, A.A., Narodytska, N., Ignatiev, A., et al., 2022. Constraint-driven explanations for black box ML models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(8), 8304-8314. DOI: https://doi.org/10.1609/aaai.v36i8.20805

[15] Ciortuz, L., 1997. Constraint-Driven Concurrent Parsing Applied to Romanian Transitive VP [Internet]. Proceedings of the International Workshop on Parsing Technologies [cited 2023 Feb 14]. Available from: https://aclanthology.org/1997.iwpt-1.26.pdf

[16] Kumaran, E., 2022. Constraint-driven Agree. Proceeding of Linguist Society America. 7(1), 5282. DOI: https://doi.org/10.3765/plsa.v7i1.5282

[17] OrCAD, 2023. Integrated Front-To-Back Constraints for Right First Time Designs [Internet]. [cited 2023 Feb 14]. Available from: https://www.orcad.com/tech-solutions/constraint-driven-design

[18] Mancas, C., 2019. MatBase—A tool for transparent programming while modeling data at conceptual levels. Computer Science & Information Technology (CSITEC 2019). AIRCC Pub. Corp.: Chennai, India. pp. 15-27. DOI: https://doi.org/10.5121/csit.2019.91102

[19] Abiteboul, S., Hull, R., Vianu, V., 1995. Foundations of databases. Addison-Wesley: IL, USA.

[20] Mancas, C., 2015. Conceptual data modeling and database design: A completely algorithmic approach. Volume I: The shortest advisable path. Apple Academic Press/CRC Press (Taylor & Francis Group): FL, USA.

[21] Kleppmann, M., 2016. Designing data-intensive applications: The big ideas behind reliable, scalable, and maintainable systems. O' Reilly: UK.

[22] Mancas, C., 2018. MatBase constraint sets coherence and minimality enforcement algorithms. Advances in databases and information systems. Springer: Switzerland. pp. 263-277. DOI: https://doi.org/10.1007/978-3-319-98398-1_18

[23] Thalheim, B., 2000. Entity-relationship modeling: Foundations of database technology. Springer Berlin: Heidelberg.

[24] Mancas, C., Dragomir, S., 2004. Matbase Datalog Subsystem Metacatalog Conceptual Design [Internet]. Proceedings of the IASTED Conference on Software Engineering and Applications, November 9-11, 2004, MIT, Cambridge, MA, USA. Acta Press: Canada. pp. 34-41 [cited 2023 Feb 14]. Available from: https://www.actapress.com/PaperInfo.aspx?PaperID=19050&reason=500

[25] Mancas, C., Mancas, S., 2005. Matbase Entity-Relationship Diagrams Subsystem Metacatalog Conceptual Design [Internet]. IASTED International Conference on Databases and Applications, Part of the 23rd Multi-Conference on Applied Informatics, Innsbruck, Austria. pp. 83-89. Acta Press: Canada. [cited 2023 Feb 14]. Available from: https://www.actapress.com/PaperInfo.aspx?PaperID=19050&reason=500

[26] Mancas, C., 2023. 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): FL, USA.

[27] Mancas, C., 2016. Algorithms for key discovery assistance. BIR 2016, lecture notes in business information processing. Springer: Switzerland. pp. 261, 322-338. DOI: https://doi.org/10.1007/978-3-319-45321-7_23

[28] Mancas, C., 2019. MatBase E-RD cycles associated non-relational constraints discovery assistance algorithm. Intelligent computing. Springer: Switzerland. pp. 390-409. DOI: https://doi.org/10.1007/978-3-030-22871-2_27

[29] Mancas, C., 2019. MatBase autofunction non-relational constraints enforcement algorithms. IJCSIT. 11(5), 63-76. DOI: https://doi.org/10.5121/ijcsit.2019.11505

[30] Mancas, C., 2020. On detecting and enforcing the non-relational constraints associated to dyadic relations in MatBase. Journal of Electronic & Information Systems. 2(2), 1-8. DOI: https://doi.org/10.30564/jeisr.v2i2.2090

[31] No1Reviews.com [Internet]. Reviews of the Top 10 Genealogy Software of 2023 [cited 2023 Feb 14]. Available from: https://genealogy-software.no1reviews.com

Downloads

How to Cite

Mancas, C., Serban, C., & Mancas, D. C. (2023). On Software Application Database Constraint-driven Design and Development. Journal of Computer Science Research, 5(1), 31–45. https://doi.org/10.30564/jcsr.v5i1.5476

Issue

Vol. 5 , Iss. 1 (January 2023)

Article Type

Article

License

Copyright © 2023 Christian Mancas

Creative Commons License

This is an open access article under the Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) License.

Crossref
Scopus
Google Scholar
Europe PMC