The Community for Technology Leaders
2011 IEEE 27th International Conference on Data Engineering Workshops (2011)
Hannover, Germany
Apr. 11, 2011 to Apr. 16, 2011
ISBN: 978-1-4244-9195-7
pp: 194-199
Vicky Dritsou , Department of Informatics, Athens University of Economics and Business, Greece
Panos Constantopoulos , Department of Informatics, Athens University of Economics and Business, Greece
Antonios Deligiannakis , Department of Electronic and Computer Engineering, Technical University of Crete, Greece
Yannis Kotidis , Department of Informatics, Athens University of Economics and Business, Greece
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.
INDEX TERMS
CITATION

V. Dritsou, A. Deligiannakis, P. Constantopoulos and Y. Kotidis, "Shortcut selection in RDF databases," 2011 IEEE 27th International Conference on Data Engineering Workshops(ICDEW), Hannover, Germany, 2011, pp. 194-199.
doi:10.1109/ICDEW.2011.5767659
284 ms
(Ver 3.3 (11022016))