A Comparison of RDF Query Languages

Haase, Peter; Broekstra, Jeen; Eberhart, Andreas; Volz, Raphael

doi:10.1007/978-3-540-30475-3_35

Cited by 136 publications

(87 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The conjunctive fragment of most RDF query languages (e.g., see [8,9]) consists of queries of the form H ← B, where the body of the query B is a graph pattern, that is, an RDF graph over IRIs, literals, blanks, and variables. The head of the query H is either a graph pattern or a tuple variable (list of variables).…”

Section: Introductionmentioning

confidence: 99%

A Relaxed Approach to RDF Querying

Hurtado

Poulovassilis

Wood

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We explore flexible querying of RDF data, with the aim of making it possible to return data satisfying query conditions with varying degrees of exactness, and also to rank the results of a query depending on how "closely" they satisfy the query conditions. We make queries more flexible by logical relaxation of their conditions based on RDFS entailment and RDFS ontologies. We develop a notion of ranking of query answers, and present a query processing algorithm for incrementally computing the relaxed answer of a query. Our approach has application in scenarios where there is a lack of understanding of the ontology underlying the data, or where the data objects have heterogeneous sets of properties or irregular structures.

show abstract

Section: Introductionmentioning

confidence: 99%

A Relaxed Approach to RDF Querying

Hurtado

Poulovassilis

Wood

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…With the exception of the RQL distinction between exact (denoted with '^') and extended pattern matching for class (^c{X} and c{X}) and property ({X}^p{Y} and {X}p{Y}) instances, all the other patterns are encountered in the majority of the RDF/S query languages. In this context, the SQO algorithms presented in this paper for the two most expressive previous RQL fragments [12] can be naturally applied to other RDF/S query languages as long as the appropriate translations of their patterns to SWLF are provided.…”

Section: Rdf/s Query Languages' Fragmentsmentioning

confidence: 99%

Containment and Minimization of RDF/S Query Patterns

Serfiotis

Koffina

Christophides

et al. 2005

The Semantic Web – ISWC 2005

View full text Add to dashboard Cite

Abstract. Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extensively studied for relational, deductive, object, and XML databases. However, less attention to SQO has been devoted in the context of the Semantic Web. In this paper, we present sound and complete algorithms for the containment and minimization of RDF/S query patterns. More precisely, we consider two widely used RDF/S query fragments supporting pattern matching at the data, but also, at the schema level. To this end, we advocate a logic framework for capturing the RDF/S data model and semantics and we employ well-established techniques proposed in the relational context, in particular, the Chase and Backchase algorithms.

show abstract

“…To the best of our knowledge, RUL is the first declarative language supporting fine-grained updates at the class and property instance level, has a deterministic semantics for set-oriented updates and takes benefit of the full expressive power of RQL for restricting the range of variables to nodes and arcs of RDF data graphs. However, our design can be also immediately transferred to other RDF query languages (e.g., RDQL [11], or SPARQL [12]) offering less expressive pattern matching capabilities [13].…”

Section: Introductionmentioning

confidence: 99%

RUL: A Declarative Update Language for RDF

Magiridou

Sahtouris

Christophides

et al. 2005

The Semantic Web – ISWC 2005

View full text Add to dashboard Cite

Abstract. We propose a declarative update language for RDF graphs which is based on the paradigms of query and view languages RQL and RVL. Our language, called RUL, ensures that the execution of the update primitives on nodes and arcs neither violates the semantics of the RDF model nor the semantics of the given RDFS schema. In addition, RUL supports fine-grained updates at the class and property instance level, set-oriented updates with a deterministic semantics and takes benefit of the full expressive power of RQL for restricting the range of variables to nodes and arcs of RDF graphs.

show abstract

A Comparison of RDF Query Languages

Cited by 136 publications

References 5 publications

A Relaxed Approach to RDF Querying

A Relaxed Approach to RDF Querying

Containment and Minimization of RDF/S Query Patterns

RUL: A Declarative Update Language for RDF

Contact Info

Product

Resources

About