Abstract
We present a graph data model, called PROPER, which is based on property graphs. Our model consists of a property graph G “augmented” with the concepts of hyper node and hyper edge. A hyper node is an abstraction of a set of nodes of G having the same properties; and a hyper edge is an abstraction of a set of edges of G having the same label. A graph database over G is defined to be a higher level property graph whose nodes and edges are hyper nodes and hyper edges over G. We introduce a set of operations that generate new hyper nodes and new hyper edges from old, therefore providing the basis for a query language in PROPER. We call this set the “graph algebra”. We also show how certain semantic constructs such as equational constraints and ISA relationships can be defined in our model.
We demonstrate the expressive power of PROPER by showing how a relational database, together with functional dependencies, can be embedded in PROPER in the form of a graph database; and how the relational algebra operations can be mapped as operations of the graph algebra.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. (CSUR) 40(1), 2012–2015 (2008)
Wood, P.T.: Query languages for graph databases. ACM SIGMOD Rec. 41(1), 50–60 (2012)
W3C: Resource Description Framework (RDF) Model and Syntax Specification. https://www.w3.org/TR/PR-rdf-syntax/
Levene, M., Poulovassilis, A.: An object-oriented data model formalised through hypergraphs. Data Knowl. Eng. 6(3), 205–224 (1991)
Easley, D., Kleinberg, J., Crowds, M.: Reasoning about a Highly Connected World. Cambridge University Press, Cambridge (2010)
Robinson, I., Webber, J., Eifrem, E.: Graph Databases. O’Reilly Media, New York (2015)
Rodriguez, M.A., Neubauer, P.: The graph traversal pattern management, graph data management techniques and applications. In: Sakr, S., Pardede, E. (eds.) IGI Global, ISBN: 9781613500538, August 2011
De Virgilio, R., Maccioni, A., Torlone, R.: R2G: a tool for migrating relations to graphs. In: EDBT/ICDT 2014 Joint Conference (2014)
Boncz, P., Manegold, S., Kersten, M.: Database architecture optimized for the new bottleneck: memory access. In: Proceedings of VLDB 1999, p. 5465 (1999)
Cebiric, S., Goasdoue, F., Manolescu, I.: Query-oriented summarization of RDF graphs. Proc. VLDB Endow. 8(12), 1–39 (2015)
Campinas, S., Perry, T., Ceccarelli, D., Delbru, R., Tummarello, G.: Introducing RDF graph summary with application to assisted SPARQL formulation. In: DEXA Workshops (2012)
Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (2008)
Sahoo, S.S., et al.: A survey of current approaches for mapping of relational databases to RDF. W3C RDB2RDF Incubator Group Report (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Spyratos, N., Sugibuchi, T. (2016). PROPER - A Graph Data Model Based on Property Graphs. In: Grant, E., Kotzinos, D., Laurent, D., Spyratos, N., Tanaka, Y. (eds) Information Search, Integration, and Personalization. ISIP 2015. Communications in Computer and Information Science, vol 622. Springer, Cham. https://doi.org/10.1007/978-3-319-43862-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-43862-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43861-0
Online ISBN: 978-3-319-43862-7
eBook Packages: Computer ScienceComputer Science (R0)