Publications
Projects
login
About
login:
password:
Forgot your password?
SPARQL Basic Graph Pattern Optimization Using Selectivity E...
SPARQL Basic Graph Pattern Optimization Using Selectivity Estimation
Publication type:
inproceedings
Authors:
Markus Stocker
,
Abraham Bernstein
,
Christoph Kiefer
,
Andy Seaborne
,
Dave Reynolds
Abstract:
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 characteristics of heuristics for selectivity-based static BGP optimization. The heuristics range from simple triple pattern variable counting to more sophisticated selectivity estimation techniques. Customized summary statistics for RDF data enable the selectivity estimation of joined triple patterns and the development of efficient heuristics. Using the Lehigh University Benchmark (LUBM), we evaluate the performance of the heuristics for the queries provided by the LUBM and discuss some of them in more details. Note that the SPARQL versions of the 14 LUBM queries and the University0 data set we used in this paper can be downloaded from here.
Title:
SPARQL Basic Graph Pattern Optimization Using Selectivity Estimation
Year:
2008
Publisher:
ACM
booktitle:
Proceedings of the 17th International World Wide Web Conference (WWW)
month:
April
address:
New York, NY, USA
note:
to appear, data set available online: http://www.ifi.uzh.ch/ddis/fileadmin/user_upload/kiefer/optarq/LUBM.zip
group:
ddis
actions
