brTPF：约束限制的三重模式片段（扩展预印本）
brTPF: Bindings-Restricted Triple Pattern Fragments (Extended Preprint)
摘要：
Triple Pattern Fragment（TPF）接口是最近提出的一个建议，用于减少基于Web的方法在公共RDF数据集上执行SPARQL查询时的服务器负载。服务器过载较少的代价是更高的客户端负载和网络负载的大幅增加（就HTTP请求和数据传输的数量而言）。在本文中，我们提出了一个稍微扩展的接口，允许客户端附加中间结果的三重模式请求。对这样的请求的响应应该包含来自底层数据集的三元组，这些三元组不仅与给定的三元组模式匹配（如TPF的情况），而且保证有助于与给定的中间结果进行连接。我们的假设是，使用此扩展接口的分布式查询执行可以减少网络负载（与纯基于TPF的查询执行相比），而不会显着降低客户端-服务器系统的整体吞吐量。我们在本文中的主要贡献是双重的：我们实证验证的假设，并提供了一个广泛的实验比较，我们的建议和TPF。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
