Towards a top-K SPARQL query benchmark generator

Journal article (2014)

Authors

Shima Zahmatkesh Politecnico di Milano
Emanuele Della Valle Politecnico di Milano
Daniele Dell'Aglio Politecnico di Milano
A. Bozzon Web Information Systems - EEMCS
Research Group
Web Information Systems (EEMCS) (TU Delft)
Copyright: © 2014 Shima Zahmatkesh, Emanuele Della Valle, Daniele Dell'Aglio, A. Bozzon
More Info
expand_more

Published Date

2014

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Web Information Systems

Abstract

The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches. For such a benchmark to be meaningful, at least two requirements should hold: 1) the benchmark should resemble reality as much as possible, and 2) it should stress the features of the topk SPARQL queries both from a syntactic and performance perspective. In this paper we propose Top-k DBPSB: an extension of the DBpedia SPARQL benchmark (DBPSB), a benchmark known to resemble reality, with the capabilities required to compare SPARQL engines on top-k queries.

Files

Paper_4.pdf
(pdf | 0.717 Mb)
Unknown license