8 search results - page 1 / 2 » SPARQL basic graph pattern optimization using selectivity es... |
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...
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...
EDBT
2012
ACM
11 years 6 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
ENTCS
2006
13 years 4 months ago
2006
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
XSYM
2004
Springer
13 years 9 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...