Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard

@article{Arenas2012CountingBA,
  title={Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard},
  author={Marcelo Arenas and Sebasti{\'a}n Conca and Jorge P{\'e}rez},
  journal={Proceedings of the 21st international conference on World Wide Web},
  year={2012}
}
SPARQL -the standard query language for querying RDF- provides only limited navigational functionalities, although these features are of fundamental importance for graph data formats such as RDF. This has led the W3C to include the property path feature in the upcoming version of the standard, SPARQL 1.1.We tested several implementations of SPARQL 1.1 handling property path queries, and we observed that their evaluation methods for this class of queries have a poor performance even in some very… 

Figures and Tables from this paper

Sparqling kleene: fast property paths in RDF-3X
TLDR
This paper presents a detailed account of integrating the recently proposed highly compact reachability index called FERRARI into the RDF-3X engine to support property path evaluation and develops a set of queries over real-world RDF data that can serve as benchmark set for evaluating the efficiency of property path queries.
Counting to k or how SPARQL1.1 Property Paths Can Be Extended to Top-k Path Queries
TLDR
This paper extends SPARQL 1.1 property paths in a manner that allows to compute and return the k shortest paths matching a property path expression between two nodes, showing that a relatively simple approach works more efficiently than other, more complex algorithms in the literature in practical use cases.
On the formulation of performant SPARQL queries
D B ] 2 A pr 2 01 3 On the Formulation of Performant SPARQL Queries
TLDR
5 heuristics that can be applied to create optimised queries that are informed by formal results in the literature on the semantics and complexity of evaluating SPARQL queries and ensures that queries following these rules can be optimised effectively by an underlying RDF store.
2 CONSTRUCT Queries in SPARQL
TLDR
The study of SPARQL CONSTRUCT queries, that is, queries which output RDF graphs, is studied and it is concluded that the general language is not composable, but the aforementioned blank-free fragments are.
The complexity of regular expressions and property paths in SPARQL
TLDR
This work formalizes the W3C semantics of property paths and investigates various query evaluation problems on graphs, proving that the membership problem for regular expressions with numerical occurrence indicators and negation is in polynomial time.
The complexity of evaluating path expressions in SPARQL
TLDR
This work formalizes the W3C semantics of property paths and investigates various query evaluation problems on graphs, proving that the membership problem for regular expressions with numerical occurrence indicators and negation is in polynomial time.
CONSTRUCT Queries in SPARQL
TLDR
The study of SPARQL CONSTRUCT queries, that is, queries which output RDF graphs, is embarked on, finding that the general language is not composable, but the aforementioned blank-free fragments are.
A Context-Based Semantics for SPARQL Property Paths over the Web (Extended Version)
TLDR
This paper introduces a query semantics for PPs that couples navigation at the data level with navigation on the Web graph, and establishes a decidable syntactic property of such queries to enable systems to identify queries that can be evaluated completely.
SPARQL with Property Paths
TLDR
It is shown that although the addition of property paths has no impact on query evaluation, they do make the containment and subsumption problems substantially more difficult.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
Semantics and complexity of SPARQL
TLDR
This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.
nSPARQL: A Navigational Language for RDF
TLDR
This paper shows that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph, and studies the expressiveness of the combination of nested regular expressions and SPARQL operators.
Executing SPARQL Queries over the Web of Linked Data
TLDR
An approach to execute SPARQL queries over the Web of Linked Data using an iterator-based pipeline to discover data that might be relevant for answering a query during the query execution itself and an extension of the iterator paradigm is proposed.
Expressive languages for path queries over graph-structured data
TLDR
A class of extended CRPQs, called ECRPZs, are proposed, which add regular relations on tuples of paths, and allow path variables in the heads of queries, and study their properties.
On the Semantics of SPARQL
TLDR
This chapter gives a detailed description of the semantics of this language, a query language called SPARQL, including all the features in the specification by the W3C such as blank nodes in graph patterns and bag semantics for solutions.
Extending SPARQL with regular expression patterns (for querying RDF)
Rewriting of regular expressions and regular path queries
TLDR
This paper presents a method for computing the rewriting of a regular expression E in terms of other regular expressions, and illustrates how to exploit the method for view-based rewriting of regular path queries in semi-structured data.
Conditional XPath
TLDR
It is shown that there exists a natural expansion of Core XPath in which every first-order definable path in XML document trees is expressible, and this expansion is called Conditional XPath.
The KGRAM Abstract Machine for Knowledge Graph Querying
  • O. Corby, C. Faron-Zucker
  • Computer Science
    2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
  • 2010
TLDR
The KGRAM abstract machine dedicated to querying knowledge graphs is presented as the result of an abstraction process to reach a generic solution to the problem of querying graphs in various models.
Jena: implementing the semantic web recommendations
The new Semantic Web recommendations for RDF, RDFS and OWL have, at their heart, the RDF graph. Jena2, a second-generation RDF toolkit, is similarly centered on the RDF graph. RDFS and OWL reasoning
...
1
2
3
4
...