星型图碎片：通过星型图构建知识图谱
Star Pattern Fragments: Accessing Knowledge Graphs through Star Patterns
摘要：
语义Web提供了对通过SPARQL端点访问的大量互联信息的访问。这样的端点提供了一个定义良好的接口来检索复杂SPARQL查询的结果。处理这种SPARQL端点的计算负载提供了对大量互连信息的访问。虽然它们提供了一个定义良好的接口来有效地检索复杂SPARQL查询的结果，但复杂的查询负载很容易使端点过载或崩溃，因为回答查询的所有计算负载都完全驻留在托管端点的服务器上。最近提出的接口，如三重模式片段，因此，在非选择性三重模式的情况下，以增加网络流量为代价，将一些查询处理负载从服务器转移到客户端。因此，本文提出了星型模式片段（SPF），RDF接口，使服务器和客户端之间的一个更好的负载均衡分解成星形的子查询，SPARQL查询，评估他们在服务器端。使用合成数据（WatDiv）和真实数据（DBpedia）的实验表明，SPF不仅显著减少了网络流量，而且在高查询负载下比最先进的接口快两个数量级。
英文摘要：
The Semantic Web offers access to a vast Web of interlinked information accessible via SPARQL endpoints. Such endpoints offer a well-defined interface to retrieve results for complex SPARQL queries. The computational load for processing such SPARQL endpoints offer access to a vast amount of interlinked information. While they offer a well-defined interface for efficiently retrieving results for complex SPARQL queries, complex query loads can easily overload or crash endpoints as all the computational load of answering the queries resides entirely with the server hosting the endpoint. Recently proposed interfaces, such as Triple Pattern Fragments, have therefore shifted some of the query processing load from the server to the client at the expense of increased network traffic in the case of non-selective triple patterns. This paper therefore proposes Star Pattern Fragments (SPF), an RDF interface enabling a better load balancing between server and client by decomposing SPARQL queries into star-shaped subqueries, evaluating them on the server side. Experiments using synthetic data (WatDiv), as well as real data (DBpedia), show that SPF does not only significantly reduce network traffic, it is also up to two orders of magnitude faster than the state-of-the-art interfaces under high query load.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
