SJoin: A Semantic Join Operator to Integrate Heterogeneous RDF Graphs

2017 ◽  
pp. 206-221 ◽  
Author(s):  
Mikhail Galkin ◽  
Diego Collarana ◽  
Ignacio Traverso-Ribón ◽  
Maria-Esther Vidal ◽  
Sören Auer
Keyword(s):  
Rdf Graphs

Approximate querying of RDF graphs via path alignment

2014 ◽  
Vol 33 (4) ◽  
pp. 555-581 ◽  
Author(s):  
Roberto De Virgilio ◽  
Antonio Maccioni ◽  
Riccardo Torlone
Keyword(s):  
Rdf Graphs ◽  
Approximate Querying

Canonical Forms for Isomorphic and Equivalent RDF Graphs

2017 ◽  
Vol 11 (4) ◽  
pp. 1-62 ◽  
Author(s):  
Aidan Hogan
Keyword(s):  
Canonical Forms ◽  
Rdf Graphs

scholarly journals From Natural Language to RDF Graphs with Pregroups

2017 ◽  
Author(s):  
Antonin Delpeuch ◽  
Anne Preller
Keyword(s):  
Side Effects ◽  
Semantic Web ◽  
Natural Language ◽  
Relative Clauses ◽  
Semantic Category ◽  
Target Language ◽  
Pregroup Grammars ◽  
Unbounded Dependencies ◽  
Efficient Type ◽  
Rdf Graphs

We define an algorithm translating natural language sentences to the formal syntax of RDF, an existential conjunctive logic widely used on the Semantic Web. Our translationis based on pregroup grammars, an efficient type-logical grammatical framework with atransparent syntax-semantics interface. We introduce a restricted notion of side effects inthe semantic category of finitely generated free semimodules over {0,1} to that end.The translation gives an intensional counterpart to previous extensional models.We establish a one-to-one correspondence between extensional models and RDF models such that satisfaction is preserved. Our translation encompasses the expressivity of the target language and supports complex linguistic constructions like relative clauses and unbounded dependencies.

scholarly journals Constrained regular expressions for answering RDF-path queries modulo RDFS

2014 ◽  
Vol 10 (1) ◽  
pp. 24-50 ◽  
Author(s):  
Faisal Alkhateeb ◽  
Jerome Euzenat
Keyword(s):  
Design Methodology ◽  
Regular Expressions ◽  
Content Type ◽  
Theoretical Comparison ◽  
Proper Extension ◽  
Evaluation Algorithm ◽  
Rdf Graphs ◽  
Path Queries ◽  
Practical Implications

Purpose – The paper aims to discuss extensions of SPARQL that use regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics (in particular, nSPARQL and our proposal CPSPARQL). Design/methodology/approach – The paper is based upon a theoretical comparison of the expressiveness and complexity of both nSPARQL and the corresponding fragment of CPSPARQL, that we call cpSPARQL. Findings – The paper shows that nSPARQL and cpSPARQL (the fragment of CPSPARQL) have the same complexity through cpSPARQL, being a proper extension of SPARQL graph patterns, is more expressive than nSPARQL. Research limitations/implications – It has not been possible to the authors to compare the performance of our CPSPARQL implementation with other proposals. However, the experimentation has allowed to make interesting observations. Practical implications – The paper includes implications for implementing the SPARQL RDFS entailment regime. Originality/value – The paper demonstrates the usefulness of cpSPARQL language. In particular, cpSPARQL, which is sufficient for capturing RDFS semantics, admits an efficient evaluation algorithm, while the whole CPSPARQL language is in theory as efficient as SPARQL is. Moreover, using such a path language within the SPARQL structure allows for properly extending SPARQL.

Sign in / Sign up

Export Citation Format

Share Document