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 characteristics of heuristics for selectivitybased 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. Categories and Subject Descriptors H.2.4 [Database Management]: Systems--query processing General Terms Algorithms, Performance Keywords SPARQL, query optimization, selectivity estimation

• Type: Conference
• Year: 2008
• Where: WWW
• Authors: Markus Stocker, Andy Seaborne, Abraham Bernstein, Christoph Kiefer, Dave Reynolds
• Keywords: Efficient Heuristics, Internet Technology, Sophisticated Selectivity Estimation, Static Bgp Optimization, WWW 2008