SPARQL Query Processing with Conventional Relational Database Systems

Harris, Steven; Shadbolt, Nigel

doi:10.1007/11581116_25

Cited by 78 publications

(53 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Such a relational database provides efficient lookups through the use of indexes. We use a standard schema designed for RDF applications [9]. It mainly consists of two tables.…”

Section: Database Schemamentioning

confidence: 99%

An Efficient Light Solver for Querying the Semantic Web

Saint-Marcq

Deville

Solnon

2011

Principles and Practice of Constraint Programming – CP 2011

View full text Add to dashboard Cite

Abstract. The Semantic Web aims at building cross-domain and distributed databases across the Internet. SPARQL is a standard query language for such databases. Evaluating such queries is however NP-hard. We model SPARQL queries in a declarative way, by means of CSPs. A CP operational semantics is proposed. It can be used for a direct implementation in existing CP solvers. To handle large databases, we introduce a specialized and efficient light solver, Castor. Benchmarks show the feasibility and efficiency of the approach.

show abstract

“…Such a relational database provides efficient lookups through the use of indexes. We use a standard schema designed for RDF applications [9]. It mainly consists of two tables.…”

Section: Database Schemamentioning

confidence: 99%

An Efficient Light Solver for Querying the Semantic Web

Saint-Marcq

Deville

Solnon

2011

Principles and Practice of Constraint Programming – CP 2011

View full text Add to dashboard Cite

show abstract

“…Most of them use a query model based on relational algebra [24], where RDF graphs are viewed as a collection of triples and the queries are triple-based formulas expressed over a single relation. In spite of the benefits gained from the existing relational database systems such as indexing mechanisms, underlying storage of triples as relations [38], query optimization techniques, and others; relational queries cannot express recursive relations and even the most simple form, the transitive closure of a relation [6], directly inherited from the graph nature of RDF triples.…”

Section: Rdf Query Languagesmentioning

confidence: 99%

“…The authors propose a translation system between SPARQL and SQL to make a correspondence between SPARQL queries and relational algebra queries over a single relation. [38] presents an implementation of SPARQL queries in a relational database engine, in which relational algebra operators similar to [3] are used. [30] addresses the definition of mapping for SPARQL from a logical point of view.…”

Section: Work On Sparqlmentioning

confidence: 99%

Extending SPARQL with regular expression patterns (for querying RDF)

Alkhateeb

Baget

Euzenat

2009

Journal of Web Semantics

119

View full text Add to dashboard Cite

“…The most recent version of 3store [49] allows the formulation of queries in SPARQL, which supports the concept of named graphs. Therefore, the statements table contains an additional row which indicates the graph that the statement belongs to (triples with such provenance information are often called quads.…”

Section: Rdf Storage In Jena1 and Jena2mentioning

confidence: 99%

RDF Querying: Language Constructs and Evaluation Methods Compared

Furche¹,

Linse²,

Bry³

et al. 2006

Reasoning Web

View full text Add to dashboard Cite

Abstract. This article is firstly an introduction into query languages for the Semantic Web, secondly an in-depth comparison of the languages introduced. Only RDF query languages are considered because, as of the writing of this paper, query languages for other Semantic Web data modeling formalisms, especially OWL, are still an open research issue, and only a very small number of, furthermore incomplete, proposals for querying Semantic Web data modeled after other formalisms than RDF exist. The limitation to a few RDF query languages is motivated both by the objective of an in-depth comparison of the languages addressed and by space limitations. During the three years before the writing of this article, more than three dozen proposals for RDF query languages have been published! Not only such a large number, but also the often immature nature of the proposals makes the focus on few, but representative languages a necessary condition for a non-trivial comparison.For this article, the following RDF query languages have been, admittedly subjectively, selected: Firstly, the "relational" or "pattern-based" query languages SPARQL, RQL, TRIPLE, and Xcerpt; secondly the reactive rule query language Algae; thirdly and last the "navigational access" query language Versa. Although subjective, this choice is arguably a good coverage of the diverse language paradigms considered for querying RDF data. It is the authors' hope and expectation, that this comparison will motivate and trigger further similar studies, thus completing the present article and overcoming its limitation.

show abstract

SPARQL Query Processing with Conventional Relational Database Systems

Abstract: Abstract. This paper describes an evolution of the 3store RDF storage system, extended to provide a SPARQL query interface and informed by lessons learned in the area of scalable RDF storage.

Cited by 78 publications

References 1 publication

An Efficient Light Solver for Querying the Semantic Web

An Efficient Light Solver for Querying the Semantic Web

Extending SPARQL with regular expression patterns (for querying RDF)

RDF Querying: Language Constructs and Evaluation Methods Compared

Contact Info

Product

Resources

About