Towards a top-K SPARQL query benchmark generator

Journal Article (2014)
Author(s)

Shima Zahmatkesh (Politecnico di Milano)

Emanuele Della Valle (Politecnico di Milano)

Daniele Dell'Aglio (Politecnico di Milano)

A Bozzon (TU Delft - Web Information Systems)

Research Group
Web Information Systems
Copyright
© 2014 Shima Zahmatkesh, Emanuele Della Valle, Daniele Dell'Aglio, A. Bozzon
More Info
expand_more
Publication Year
2014
Language
English
Copyright
© 2014 Shima Zahmatkesh, Emanuele Della Valle, Daniele Dell'Aglio, A. Bozzon
Research Group
Web Information Systems
Volume number
1272
Pages (from-to)
349-352
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.

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_91.pdf
(pdf | 0.472 Mb)
License info not available