A Comparison of Current Graph Database Models

Authors:
Renzo Angles
Affiliations:
-
Venue:
ICDEW '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering Workshops
Year:
2012

Citing 0
Cited 3

Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j

Proceedings of the Joint EDBT/ICDT 2013 Workshops
Trial for RDF: adapting graph query languages for RDF data

Proceedings of the 32nd symposium on Principles of database systems
Benchmarking database systems for social network applications

First International Workshop on Graph Data Management Experiences and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The limitations of traditional databases, in particular the relational model, to cover the requirements of current applications has lead the development of new database technologies. Among them, the Graph Databases are calling the attention of the database community because in trendy projects where a database is needed, the extraction of worthy information relies on processing the graph-like structure of the data. In this paper we present a systematic comparison of current graph database models. Our review includes general features (for data storing and querying), data modeling features (i.e., data structures, query languages, and integrity constraints), and the support for essential graph queries.