Extended Query Pattern Graph and Heuristics - based SPARQL Query Planning
Author(s) -
Fuqi Song,
Olivier Corby
Publication year - 2015
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2015.08.130
Subject(s) - sparql , computer science , rdf query language , query optimization , query language , query expansion , web query classification , web search query , sargable , named graph , information retrieval , heuristics , database , rdf , semantic web , search engine , operating system
International audienceSPARQL query language plays a significant role in developing semantic web and web intelligence. In order to deal with large data query execution over RDF, SPARQL query optimizer is an essential component in the SPARQL query engine for improving query execution performance. This paper proposes an approach for performing query planning and optimization based on an extended query pattern graph and heuristics. First, this paper generalizes SPARQL query statement representation by taking other expressions into account, aiming at overcoming the limitations of only using basic query triple patterns. Second, this paper presents the heuristics for estimating the cost of executing query triple pattern. The proposed query planning methods are implemented within Corese query engine and are evaluated using BSBM benchmark. The results suggest that the proposed methods can optimize effectively the query execution time of SPARQL query engine
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom