CostFed: Cost-Based Query Optimization for SPARQL Endpoint Federation
Author(s) -
Muhammad Saleem,
Alexander Potocki,
Tommaso Soru,
Olaf Hartig,
Axel-Cyrille Ngonga Ngomo
Publication year - 2018
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.2018.09.016
Subject(s) - computer science , sparql , benchmark (surveying) , query optimization , joins , usability , selection (genetic algorithm) , information retrieval , query expansion , database , rdf , data mining , semantic web , operating system , artificial intelligence , geodesy , programming language , geography
The runtime optimization of federated SPARQL query engines is of central importance to ensure the usability of the Web of Data in real-world applications. The efficient selection of sources (SPARQL endpoints in our case) as well as the generation of optimized query plans belong to the most important optimization steps in this respect. This paper presents CostFed, an index-assisted federation engine for federated SPARQL query processing. CostFed makes use of statistical information collected from endpoints to perform efficient source selection and cost-based query planning. In contrast to the state of the art, it relies on a non-linear model for the estimation of the selectivity of joins. Therewith, it is able to generate better plans than the state-of-the-art federation engines. Our experiments on the FedBench benchmark shows that CostFed is 3 to 121 times faster than the current federation engines.
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