Designing Graph Databases With GRAPHED

Designing Graph Databases With GRAPHED

Gustavo Cordeiro Galvão Van Erven, Rommel Novaes Carvalho, Waldeyr Mendes Cordeiro da Silva, Sergio Lifschitz, Harley Vera-Olivera, Maristela Holanda
Copyright: © 2019 |Pages: 20
DOI: 10.4018/JDM.2019010103
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In recent years, graph database systems have become very popular and been deployed mainly in situations where the relationship between data is significant, such as in social networks. Although they do not require a particular schema design, a data model contributes to their consistency. Designing diagrams is an approach to satisfying this demand for a conceptual data model. While researchers and companies have been developing concepts and notations for graph database modeling, their notations focus on their specific implementations. In this article, the authors propose a diagram to address this lack of a generic and comprehensive notation for graph databases modeling, named GRAPHED (Graph Description Diagram for Graph Databases). The authors verified the effectiveness and compatibility of GRAPHED in two case studies: fraud identification, and a biological network model.
Article Preview
Top

Introduction

Data modeling is an essential part of the development of quality information systems. There are sufficient reasons such as leverage, consistency and data quality why data modeling should deserve more attention than other components of a system (Bera and Poels, 2017; Sabegh and Recker, 2017). Data modeling of relational databases is well established and standardized. The academic and business community widely accept the entity-relationship model. However, new ways of storing data arose with the emergence of social networks, mobile devices, web technologies and the Internet of Things called NoSQL databases (Davoudian, Chen, and Liu 2018). These new technologies of storing data like document-oriented, key-value, column and graphs have properties that allow better performance when storing a large amount of data (Gil and Song, 2016; Batini, Rula, Scannapieco, and Viscusi, 2015).

The importance of information about the relationships among objects is increasing in applications. Those solutions are used for problems in several areas such as business intelligence (Maté et al., 2015), chemical and biological networks (Silva, 2018), relationship structures, connected circuits in engineering, friends, and partners in social media or even the search for and identification of criminal cells are just some of the examples of the importance of relationships among objects (Srinivasa, 2011). Graphs often represent such data sets and their relationships.

Graphs can be defined generally as consisting of a set of vertices (or nodes) connected by edges defining some relationship between them (Deo, 1994). Graph algorithms provide solutions to several problems such as finding friends of friends in a social network, best paths between places in a city on a map, or people with similar interests in e-commerce (Batra and Tyagi, 2012). Thus, applications that address these kinds of problems can be enhanced using persistent graphs.

Using a graph as the primary structure in databases is not a new idea (Angles and Gutierrez, 2008). Moreover, the number of initiatives that use graph-based structures in databases has increased (Ruflin, Burkhart, and Rizzotti, 2011; Angles, Prat-Pérez, Dominguez-Sal, and Larriba-Pey, 2013). Several groups and companies have developed and improved database systems that can store a graph in its native form. Such initiatives include structures and query mechanisms that simplify the work of processing highly connected data (Kaur and Rani, 2013; Angles, 2012; Hecht and Jablonski, 2011; Vicknair et al., 2010).

However, although there have been advances in graph database technology, a notation to represent the conceptual graph model continues to present a challenge. There is no approach for data model widely accepted by the academic and business community in the graph databases. Several specific proposals of notations for diagram designs can be found in specialized literature (Angles and Gutierrez, 2008; Gyssens, Paredaens, and van Gucht, 1990; Amann and Scholl, 1992; Mainguenaud and Simatic, 1992; Kuper and Vardi, 1993; Hidders and Paredaens, 1994; Levene and Loizou, 1995; Levene and Poulovassilis, 1991; Hidders, 2003). Almost all of them bring schemas and instances to facilitate comprehension; however, they are focused on their particular implementations.

Complete Article List

Search this Journal:
Reset
Volume 35: 1 Issue (2024)
Volume 34: 3 Issues (2023)
Volume 33: 5 Issues (2022): 4 Released, 1 Forthcoming
Volume 32: 4 Issues (2021)
Volume 31: 4 Issues (2020)
Volume 30: 4 Issues (2019)
Volume 29: 4 Issues (2018)
Volume 28: 4 Issues (2017)
Volume 27: 4 Issues (2016)
Volume 26: 4 Issues (2015)
Volume 25: 4 Issues (2014)
Volume 24: 4 Issues (2013)
Volume 23: 4 Issues (2012)
Volume 22: 4 Issues (2011)
Volume 21: 4 Issues (2010)
Volume 20: 4 Issues (2009)
Volume 19: 4 Issues (2008)
Volume 18: 4 Issues (2007)
Volume 17: 4 Issues (2006)
Volume 16: 4 Issues (2005)
Volume 15: 4 Issues (2004)
Volume 14: 4 Issues (2003)
Volume 13: 4 Issues (2002)
Volume 12: 4 Issues (2001)
Volume 11: 4 Issues (2000)
Volume 10: 4 Issues (1999)
Volume 9: 4 Issues (1998)
Volume 8: 4 Issues (1997)
Volume 7: 4 Issues (1996)
Volume 6: 4 Issues (1995)
Volume 5: 4 Issues (1994)
Volume 4: 4 Issues (1993)
Volume 3: 4 Issues (1992)
Volume 2: 4 Issues (1991)
Volume 1: 2 Issues (1990)
View Complete Journal Contents Listing