14 search results - page 1 / 3 » Estimating selectivity for joined RDF triple patterns |
CIKM
2011
Springer
12 years 4 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is ...
SIGMOD
2009
ACM
14 years 4 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Understanding how users tailor their SPARQL queries is crucial when designing query evaluation engines or fine-tuning RDF stores with performance in mind. In this paper we analyz...