Presented at: 17th International World Wide Web Conference (WWW2008)http://doi.acm.org/10.1145/1367497.1367578
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 (LUMB) we evaluate the performance of the heuristics for the queries provided by the LUBM and discuss some of them in more details.
Keywords: Basic Graph Pattern Optimization, Query Optimization, SPARQL, Semantic Web, World Wide Web
Resource URI on the dog food server: http://data.semanticweb.org/conference/www/2008/paper/45
Explore this resource elsewhere: