Shortcut selection in RDF databases

Authors:
Vicky Dritsou;Panos Constantopoulos;Antonios Deligiannakis;Yannis Kotidis
Affiliations:
Department of Informatics, Athens University of Economics and Business, Greece;Department of Informatics, Athens University of Economics and Business, Greece;Department of Electronic and Computer Engineering, Technical University of Crete, Greece;Department of Informatics, Athens University of Economics and Business, Greece
Venue:
ICDEW '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering Workshops
Year:
2011

Citing 0
Cited 1

Optimizing query shortcuts in RDF databases

ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

An increasing amount of data produced nowadays is in RDF format. While significant work has been performed on view selection and query optimization algorithms in relational database systems, little attention has been paid to the problem of optimizing the performance of query workloads in RDF databases. In this paper we propose the notion of shortcuts, as a method for reducing the query processing cost. We then devise a greedy algorithm that, given a space constraint and a query workload in an RDF database, seeks to select the optimal shortcuts to materialize. Our experiments validate our approach and demonstrate that our algorithm manages to significantly reduce the query processing cost while keeping space requirements low.