Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/eswc2012/paper/research/110> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- 110 creator andreas-harth.
- 110 creator andreas-wagner.
- 110 creator guenter-ladwig.
- 110 creator rudi-studer.
- 110 creator thanh-tran.
- 110 type InProceedings.
- 110 label "Top-K Linked Data Query Processing".
- 110 sameAs 110.
- 110 abstract "In recent years, top-k query processing has attracted much attention because in large-scale scenarios, computing only the $k$ best solutions is often sufficient and also, the only affordable way to reach acceptable response time. Top-k query processing has been dealt with in different contexts. One line of research targets the so-called join top-k, where the goal is to produce the k best final results through joining partial results. In this paper, we study join top-k in the Linked Data setting, where partial results to be joined come from different sources. Because the only available access pattern in this setting is URI source lookup, processing queries requires entire sources to be retrieved. Targeting this scenario, we show how existing work on join top-$k$ can be adopted to produce top-k results over Linked Data. We elaborate on strategies for book-keeping scores of partial results and to use them for better estimation of candidate result scores, i.e. to obtain tighter bounds for early termination. Based on experiments on real-world Linked Data, we show that the proposed top-$k$ processing technique substantially improves runtime performance.".
- 110 hasAuthorList authorList.
- 110 isPartOf proceedings.
- 110 keyword "Linked data query processing".
- 110 keyword "Query processing".
- 110 keyword "Top-k query processing".
- 110 title "Top-K Linked Data Query Processing".