brTPF: Bindings-Restricted Triple Pattern Fragments (Extended Preprint)
Abstract
The Triple Pattern Fragment (TPF) interface is a recent proposal for reducing server load in Web-based approaches to execute SPARQL queries over public RDF datasets. The price for less overloaded servers is a higher client-side load and a substantial increase in network load (in terms of both the number of HTTP requests and data transfer). In this paper, we propose a slightly extended interface that allows clients to attach intermediate results to triple pattern requests. The response to such a request is expected to contain triples from the underlying dataset that do not only match the given triple pattern (as in the case of TPF), but that are guaranteed to contribute in a join with the given intermediate result. Our hypothesis is that a distributed query execution using this extended interface can reduce the network load (in comparison to a pure TPF-based query execution) without reducing the overall throughput of the client-server system significantly. Our main contribution in this paper is twofold: we empirically verify the hypothesis and provide an extensive experimental comparison of our proposal and TPF.
Cite
@article{arxiv.1608.08148,
title = {brTPF: Bindings-Restricted Triple Pattern Fragments (Extended Preprint)},
author = {Olaf Hartig and Carlos Buil-Aranda},
journal= {arXiv preprint arXiv:1608.08148},
year = {2016}
}
Comments
This document is an extended preprint of a paper published in the proceedings of the ODBASE 2016 conference. In contrast to the proceedings version, this document contains Appendixes A and B which present additional experimental results