Sciweavers

Share
8 search results - page 1 / 2
» SPARQL basic graph pattern optimization using selectivity es...
Sort
View
WWW
2008
ACM
12 years 6 months ago
SPARQL basic graph pattern optimization using selectivity estimation
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...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
CIKM
2011
Springer
10 years 5 months ago
Estimating selectivity for joined RDF triple patterns
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...
Hai Huang 0003, Chengfei Liu
EDBT
2012
ACM
247views Database» more  EDBT 2012»
9 years 7 months ago
Heuristics-based query optimisation for SPARQL
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...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ENTCS
2006
162views more  ENTCS 2006»
11 years 5 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
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...
Gergely Varró, Katalin Friedl, Dánie...
XSYM
2004
Springer
129views Database» more  XSYM 2004»
11 years 10 months ago
Fractional XSketch Synopses for XML Databases
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 speciļ¬c navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
books