A Proposal for Extended Entity-Relationship Conceptual Model Mapping to the NoSQL Graph Data Model
Abstract
This article proposes a series of high-level algorithms for mapping elements of Extended Entity-Relationship (EER) conceptual model to a propertie graph logical model. In this approach, traditional database design is considered, starting with conceptual modeling and later mapping, via well-defined algorithms, for a logical graph model. It is intended that the generated logical model is used as a tool for validation and verification of integrity constraints in graph databases (GDB).
References
Codd, E. F. (1970). A Relational Model of Data for Large Shared Data Banks. Commun. ACM, 13(6):377–387.
Comyn-Wattiau, I. and Akoka, J. (2017). Model Driven Reverse Engineering of NoSQL Property Graph Databases: The case of Neo4j. 2017 IEEE International Conference on Big Data (Big Data), pages 453–458.
Gallo, G., Longo, G., Pallotino, S., and Nguyen, S. (1993). Directed hypergraphs and applications. Discrete applied mathematics, 42(2-3):177–201.
Pokorny, J. (2013). NoSQL databases: a step to database scalability in web environment. International Journal of Web Information Systems, 9(1):69–82.
Pokorny, J., Valenta, M., and Kovacic, J. (2017). Integrity constraints in graph databases. The 7th International Symposium on Frontiers in Ambient and Mobile Systems (FAMS 2017), pages 975–981.
Robinson, I., Webber, J., and Eifrem, E. (2013). Graph databases. ”O’Reilly Media, Inc.”.
Roy-Hubara, N., Rokach, L., Shapira, B., and Shoval, P. (2017). Modeling Graph Database Schema. IT Professional, 19(6):34–43.
Sadalage, P. J. and Fowler, M. (2013). NoSQL distilled: a brief guide to the emerging world of polyglot persistence. Estados Unidos: Addison-Wesley Educational Publishers.
