RDF Data in Property Graph Model

Tomaszuk, Dominik

doi:10.1007/978-3-319-49157-8_9

Cited by 15 publications

(12 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tomaszuk [39] proposes YARS serialization for transforming RDF data into PGs. This approach performs only a syntactic transformation between encoding schemes and does not cover RDF Schema.…”

Section: A From Rdf To Property Graphsmentioning

confidence: 99%

Mapping RDF Databases to Property Graph Databases

2020

Self Cite

View full text Add to dashboard Cite

RDF triplestores and property graph databases are two approaches for data management which are based on modeling, storing and querying graph-like data. In spite of such common principle, they present special features that complicate the task of database interoperability. While there exist some methods to transform RDF graphs into property graphs, and vice versa, they lack compatibility and a solid formal foundation. This paper presents three direct mappings (schema-dependent and schema-independent) for transforming an RDF database into a property graph database, including data and schema. We show that two of the proposed mappings satisfy the properties of semantics preservation and information preservation. The existence of both mappings allows us to conclude that the property graph data model subsumes the information capacity of the RDF data model.

show abstract

Section: A From Rdf To Property Graphsmentioning

confidence: 99%

Mapping RDF Databases to Property Graph Databases

2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…Users are represented by vertices, and the edges describe relationships between them. Using property graphs [5], we can additionally add some information about each person, and even that, from when they are friends.…”

Section: Introductionmentioning

confidence: 99%

“…Importantly, the property graph data model can be simply mapped back to other data models [5], [6], [7], [8]. This means that the presentation of data, for example in tabular and semistructured form, is also possible.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Named Property Graphs

Tomaszuk

Szeremeta

2018

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

The amount of information that is stored and processed by computer systems is constantly increasing. The relational model is still popular. Unfortunately, despite its simplicity, it has many disadvantages, which more often exclude it from large-scale applications. The property graph model seems to be a good alternative for describing real world data with its relationships. Therefore, property graph based databases become more and more popular every day. In this paper we introduce Named Property Graph model that allows to group graphs into separate units and describe information about them. We also present Cyphern query language that supports our proposal, mapping algorithms, use cases with the chemical data, and SDFEater that is our tool for processing data. Presented solutions are fully backward compatible with existing databases.

show abstract

“…So, the reification representation of RDF is insufficient to meet the requirement of the precise representation of knowledge [4]. Labeled Property Graph (LPG) model based on the key-value pairs has stronger expressiveness than comparable RDF [5]. This paper analyzes the reification structures from the perspective of LPG and shows appropriate representations of RDF reifications.…”

Section: Introductionmentioning

confidence: 99%

LPG Representation of the Reification of RDF

Zaho¹,

Han²,

Kim³

2018

IJET

View full text Add to dashboard Cite

Background/Objectives: It is still a challenging issue to represent the reification effectively since the reification representation of RDF standard has been revealed some drawbacks.Methods/Statistical analysis: Currently, there are two main graph data models: RDF and LPG. LPG is a popular graph data model that is usually applied to NoSQL graph databases.This paper derives three types of the reification structures in terms of the structural and semantic relationships of the reification statements. The detailed representation of each type of the reification is presented with the extended LPG model.Findings: This paper proposes a novel approach to represent the reification structure of RDF from the perspective of LPG. The paper explores the formal, conceptual properties of the conventional LPG models and proposes their extension to capture more complex knowledge structures efficiently. These augmentations of LPG can achieve more efficient and flexible resource modeling. This paper derives three types of the reification structures in terms of the structural and semantic relationships of the reification statements: assertion, quantification, and entailment.The proposed approach not only preserves the structure and semantics of the reification but also enables LPG modeling of the complex structural statements to be easy and intuitive.This can contribute to transfer RDF graphs into LPGs.Improvements/Applications: The implementation of the extended LPG and the query processing of the reification remain future work.

show abstract

RDF Data in Property Graph Model

Cited by 15 publications

References 6 publications

Mapping RDF Databases to Property Graph Databases

Mapping RDF Databases to Property Graph Databases

Named Property Graphs

LPG Representation of the Reification of RDF

Contact Info

Product

Resources

About