As the Web of Data is growing at an ever increasing speed, the lack of reliable query solutions for live public data becomes apparent. SPARQL implementations have matured and deliver impressive performance for public SPARQL endpoints, yet poor availability, especially under high loads, prevents their use in real-world applications. We propose to tackle this availability problem by defining triple pattern fragments, a specific kind of Linked Data Fragments that enable low-cost publication of queryable data by moving intelligence from the server to the client. This paper formalizes the Linked Data Fragments concept, introduces a client-side SPARQL query processing algorithm that uses a dynamic iterator pipeline, and verifies servers availability under load.
URL: http://videolectures.net/iswc2014_verborgh_querying_datasets/
Keywords: SPARQL endpoint, Linked Data fragments, Semantic Web, Triple pattern fragments, Berlin SPARQL benchmark
Author: Verborgh, Ruben
Publisher: Linkeddatafragments.org
Date created: 2014-12-19 05:00:00.000
Language: http://id.loc.gov/vocabulary/iso639-2/eng
Time required: P15M
Educational use: professionalDevelopment