brTPF: Bindings-Restricted Triple Pattern Fragments (Extended Preprint) release_dvgfgpteuzeuhmvt2m2ax7khom

by Olaf Hartig, Carlos Buil-Aranda

Released as a article .

2016  

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.
In text/plain format

Archived Files and Locations

application/pdf  834.0 kB
file_kkm2akvsundu5iz5ubvpd7o3uy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-08-30
Version   v2
Language   en ?
arXiv  1608.08148v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 53c5ab24-fc09-4c28-9021-67332cd5886b
API URL: JSON