Querying Datasets on the Web with High Availability
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, but poor availability—especially under high loads—prevents their use in real-world applications. We propose to tackle this availability problem with basic Linked Data Fragments, a concept and related techniques to publish and consume queryable data by moving intelligence from the server to the client. This paper formalizes the concept, introduces a client-side query processing algorithm using a dynamic iterator pipeline, and verifies its availability under load. The results indicate that, at the cost of lower performance, query techniques with basic Linked Data Fragments lead to high availability, thereby allowing for reliable applications on top of public, queryable Linked Data.
Full text BibTeX Mendeley
Published in 2014 in Proceedings of the 13th International Semantic Web Conference.
Keywords: Semantic Web, Linked Data, SPARQL, Linked Data Fragments, Triple Pattern Fragments, query processing, Web
Read this paper online
- Read the full text online.
- Request a digital copy of this paper.
- Add this paper to your Mendeley library.
Cite this paper in your publications
- Use the BibTeX entry to easily refer to this paper.
- Alternatively, you can refer to this paper as: Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., Cyganiak, R., et al. (2014), “Querying Datasets on the Web with High Availability”, in Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrandečić, D., Groth, P., et al. (Eds.), Proceedings of the 13th International Semantic Web Conference, Vol. 8796, Lecture Notes in Computer Science, Springer, pp. 180–196.