Abstract

The Semantic Web oers access to a vast Web of interlinked
information accessible via SPARQL endpoints. Such endpoints oer a
well-dened interface to retrieve results for complex SPARQL queries.
The computational load for processing such queries, however, lies entirely
with the server hosting the SPARQL endpoint, which can easily
become overloaded and in the worst case not only become slow in responding
but even crash so that the data becomes temporarily unavailable.
Recently proposed interfaces, such as Triple Pattern Fragments, have therefore shifted the query processing load from the server to the client. For queries involving triple patterns with low selectivity, this can easily result in high network traffic and slow execution times. In this paper, we therefore present a novel interface, Star Pattern Fragments (SPF), which decomposes SPARQL queries into star-shaped subqueries and can combine a lower network load with a higher query throughput and a comparatively low server load. Our experimental results show that our approach does not only significantly reduce network traffic but is also at least an order of magnitude faster in comparison to the state-of-the-art interfaces under high query processing load.
Original languageEnglish
Publication date2020
Volumeabs/2002.09172
Number of pages16
Publication statusPublished - 2020

Bibliographical note

DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Fingerprint Dive into the research topics of 'Star Pattern Fragments: Accessing Knowledge Graphs through Star Patterns'. Together they form a unique fingerprint.

Cite this