Documents

  • paper_91

    Final published version, 392 KB, PDF-document

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.
Original languageEnglish
Pages (from-to)349-352
Number of pages4
JournalCEUR Workshop Proceedings
Volume1272
Publication statusPublished - 2014
Event3rd International Workshop on Ordering and Reasoning: OrdRing 2014, Co-located with the 13th International Semantic Web Conference - Riva del Garda, Italy
Duration: 20 Oct 201420 Oct 2014
https://dblp.org/db/conf/semweb/ordring2014
https://dblp.org/db/conf/semweb/iswc2014p

    Research areas

  • Benchmark, SPARQL, Top-k query

ID: 54240550