Pith. sign in

REVIEW

Graph? Yes! Which one? Help!

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.13348 v1 pith:GXAFSPAV submitted 2021-10-26 cs.DB

Graph? Yes! Which one? Help!

classification cs.DB
keywords graphquerychoicedatamodelconsiderationcustomersfeatures
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Amazon Neptune is a graph database service that supports two graph (meta)models: W3C's Resource Description Framework (RDF) and Labeled Property Graphs (LPG). Customers opt in for one or the other model, and this choice determines which data modeling features can be used, and - perhaps more importantly - which query languages are available to query and manipulate the graph. The choice between the two technology stacks is difficult and requires consideration of data modeling aspects, query language features, their adequacy for current and future use cases, as well as many other factors (including developer preferences). Sometimes we see customers make the wrong choice with no easy way to reverse it later. It is therefore highly desirable that the choice of the query language can be made without consideration of what graph model is chosen, and can be easily revised or complemented at a later point. In this paper, we advocate and explore the idea of a single, unified graph data model that embraces both RDF and LPGs, and naturally supports different graph query languages on top. We investigate obstacles towards unifying the two graph data models, and propose an initial unifying model, dubbed "one graph" ("1G" for short), as the basis for moving forward.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.