RDF 1.1: Knowledge Representation and Data Integration Language for the Web

Tomaszuk, Dominik; Hyland-Wood, David

doi:10.3390/sym12010084

Cited by 25 publications

(13 citation statements)

References 108 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An efficient mechanism for the RDF graphs integrity proofs, realized by cryptographic hashing is an essential part of the process of building a chained sequence of subgraphs (RDF named graphs [29]) that follows the creation of Blockchain blocks in OntoSideChains.…”

Section: Cryptographic Aspectsmentioning

confidence: 99%

Technological Foundations of Ontological Ecosystems on the 3rd Generation Blockchains

Sopek¹,

Tomaszuk

Głąb

et al. 2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

In this article we present the technological foundations on which an ecosystem of semantic data objects can be implemented on the latest Blockchain based systems. As the most important citizens among the semantic data objects are ontologies, the ecosystem is referred to as Ontospace. The foundations can be characterized by their architectural, cryptographic and transactional aspects. The architectural aspect borrows from the latest Layer-2 protocols of the 3rd generation blockchains and from the rules of Linked Data systems creation. The cryptographic aspect represents an original work that attempts to resolve the issue of efficient hashing of the graph data structures. The transactional aspect is concerned with the graph replication consistency, conditions for the direct access to graph data from the blockchain smart-contracts and with linkage between sidechains bearing semantic objects and the main network. The large parts of the work were implemented in the context of the Ontochain project -a part of the Next Generation Internet EU Initiative.

show abstract

Section: Cryptographic Aspectsmentioning

confidence: 99%

Technological Foundations of Ontological Ecosystems on the 3rd Generation Blockchains

Sopek¹,

Tomaszuk

Głąb

et al. 2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…At the lower layers of SWS, RDF [47,79] uses Internationalized Resource Identifiers (IRIs) 1 to provide a rudimentary mechanism for reference but not identification since the same real-world object may be described with multiple IRIs.…”

Section: Keys In Semantic Web Stackmentioning

confidence: 99%

PG-Keys: Keys for Property Graphs

Angles

Bonifati

Dumbrava

et al. 2021

Proceedings of the 2021 International Conference on Management of Data

Self Cite

View full text Add to dashboard Cite

We report on a community effort between industry and academia to shape the future of property graph constraints. The standardization for a property graph query language is currently underway through the ISO Graph Query Language (GQL) project. Our position is that this project should pay close attention to schemas and constraints, and should focus next on key constraints.The main purposes of keys are enforcing data integrity and allowing the referencing and identifying of objects. Motivated by use cases from our industry partners, we argue that key constraints should be able to have different modes, which are combinations of basic restriction that require the key to be exclusive, mandatory, and singleton. Moreover, keys should be applicable to nodes, edges, and properties since these all can represent valid real-life entities. Our result is PG-Keys, a flexible and powerful framework for defining key constraints, which fulfills the above goals.PG-Keys is a design by the Linked Data Benchmark Council's Property Graph Schema Working Group, consisting of members from industry, academia, and ISO GQL standards group, intending to bring the best of all worlds to property graph practitioners. PG-Keys aims to guide the evolution of the standardization efforts towards making systems more useful, powerful, and expressive.

show abstract

“…The Resource Description Framework (RDF) [4], [5] is a standard data model proposed by the World Wide Web Consortium (W3C) to describe resources (i.e. real or abstract things) occurring in any application domain.…”

Section: B Rdf Graphsmentioning

confidence: 99%

“…RDF database systems (also called Triple Stores) [2] are systems designed to store and query linked data [3]. These systems are based on Semantic Web standards, in particular the Resource Description Framework (RDF) [4], [5] and the SPARQL query language [6]. RDF is a graph data model that allows to describe the attributes and relationships of web resources in the form of labeled, directed multigraphs.…”

Section: Introductionmentioning

confidence: 99%

PGO: Describing Property Graphs in RDF

2020

Self Cite

View full text Add to dashboard Cite

RDF and Property Graphs are data models that are being used to represent Knowledge Graphs. The definition of methods to transform RDF data into Property graph data is fundamental to allow interoperability among the systems using these models. Although both models are based on a graph structure, they have special features that complicate the definition of data transformation methods. This article presents an ontology-based approach to transform (automatically) property graphs into RDF graphs. The ontology, called PGO, defines a set of terms that allows describing the elements of a property graph. The algorithm corresponding to the transformation method is described, and some properties of the method are discussed (complexity, data preservation, and monotonicity). The results of an experimental evaluation are also presented.

show abstract

RDF 1.1: Knowledge Representation and Data Integration Language for the Web

Cited by 25 publications

References 108 publications

Technological Foundations of Ontological Ecosystems on the 3rd Generation Blockchains

Technological Foundations of Ontological Ecosystems on the 3rd Generation Blockchains

PG-Keys: Keys for Property Graphs

PGO: Describing Property Graphs in RDF

Contact Info

Product

Resources

About