Not logged in.

Contribution Details

Type Conference or Workshop Paper
Scope Discipline-based scholarship
Published in Proceedings Yes
Title SPARQL Basic Graph Pattern Optimization Using Selectivity Estimation
Organization Unit
Authors
  • M Stocker
  • A Seaborne
  • Abraham Bernstein
  • C Kiefer
  • D Reynolds
Presentation Type paper
Item Subtype Original Work
Refereed Yes
Status Published in final form
Event Title 17th International World Wide Web Conference (WWW)
Event Type conference
Event Location Beijing, China
Event Start Date April 21 - 2008
Event End Date April 25 - 2008
Abstract Text 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.
Digital Object Identifier 10.1145/1367497.1367578
Other Identification Number merlin-id:323
PDF File Download from ZORA
Export BibTeX
EP3 XML (ZORA)