Inproceedings3430: Unterschied zwischen den Versionen
Dc2606 (Diskussion | Beiträge) |
Dc2606 (Diskussion | Beiträge) |
||
Zeile 13: | Zeile 13: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=True | |Referiert=True | ||
− | |Title= | + | |Title=Pay-as-you-go Approximate Join Top-k Processing for the Web of Data |
|Year=2014 | |Year=2014 | ||
|Month=Mai | |Month=Mai |
Aktuelle Version vom 28. August 2014, 14:34 Uhr
Pay-as-you-go Approximate Join Top-k Processing for the Web of Data
Pay-as-you-go Approximate Join Top-k Processing for the Web of Data
Published: 2014
Mai
Buchtitel: Proceedings of the Extended Semantic Web Conference
Verlag: Springer
Referierte Veröffentlichung
BibTeX
Kurzfassung
For effectively searching the Web of data, ranking of results is a crucial. Top-k processing strategies have been proposed to allow an efficient processing of such ranked queries. Top-k strategies aim at computing k top-ranked results without complete result materialization. However, for many applications result computation time is much more important than result accuracy and completeness. Thus, there is a strong need for approximated ranked results. Unfortunately, previous work on approximate top-k processing is not well-suited for the Web of data. In this paper, we propose the first approximate top-k join framework for Web data and queries. Our approach is very lightweight – necessary statistics are learned at runtime in a pay-as-you-go manner. We conducted extensive experiments on state-of-art SPARQL benchmarks. Our results are very promising: we could achieve up to 65% time savings, while maintaining a high precision/recall.
Download: Media:Eswc14_awa_approx_topk.pdf