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 other citation formats
Published in 2014 in Proceedings of the 13th International Semantic Web Conference.
- Semantic Web
- Linked Data
- SPARQL
- Linked Data Fragments
- Triple Pattern Fragments
- query processing
- Web
Read this article online
- Read the full text online.
- Request a digital copy of this article.
- Comment on this article.
Cite this article in your work
Cite this article easily using its BibTeX entry:
@inproceedings{verborgh_iswc_2014,
author = {Verborgh, Ruben and Hartig, Olaf and De Meester, Ben and Haesendonck, Gerald and De Vocht, Laurens and Vander Sande, Miel and Cyganiak, Richard and Colpaert, Pieter and Mannens, Erik and Van de Walle, Rik},
booktitle = {Proceedings of the 13th International Semantic Web Conference},
title = {Querying Datasets on the {Web} with High Availability},
year = 2014,
month = oct,
volume = 8796,
pages = {180--196},
isbn = {978-3-319-11963-2},
series = {Lecture Notes in Computer Science},
editor = {Mika, Peter and Tudorache, Tania and Bernstein, Abraham and Welty, Chris and Knoblock, Craig and Vrande\v{c}i\'{c}, Denny and Groth, Paul and Noy, Natasha and Janowicz, Krzysztof and Goble, Carole},
publisher = {Springer},
doi = {10.1007/978-3-319-11964-9_12},
url = {https://linkeddatafragments.org/publications/iswc2014.pdf},
}
Alternatively, pick a reference of your choice below:
- IEEE
- R. Verborgh et al., “Querying Datasets on the Web with High Availability,” in Proceedings of the 13th International Semantic Web Conference, 2014, vol. 8796, pp. 180–196.
- ACM
- Ruben Verborgh, Olaf Hartig, Ben De Meester, Gerald Haesendonck, Laurens De Vocht, Miel Vander Sande, Richard Cyganiak, Pieter Colpaert, Erik Mannens, and Rik Van de Walle. 2014. Querying Datasets on the Web with High Availability. In Proceedings of the 13th International Semantic Web Conference (Lecture Notes in Computer Science), Springer, 180–196.
- LNCS
- Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., Cyganiak, R., Colpaert, P., Mannens, E., Van de Walle, R.: Querying Datasets on the Web with High Availability. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrandečić, D., Groth, P., Noy, N., Janowicz, K., and Goble, C. (eds.) Proceedings of the 13th International Semantic Web Conference. pp. 180–196. Springer (2014).
- APA
- Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., Cyganiak, R., Colpaert, P., Mannens, E., & Van de Walle, R. (2014). Querying Datasets on the Web with High Availability. In P. Mika, T. Tudorache, A. Bernstein, C. Welty, C. Knoblock, D. Vrandečić, P. Groth, N. Noy, K. Janowicz, & C. Goble (Eds.), Proceedings of the 13th International Semantic Web Conference (Vol. 8796, pp. 180–196). Springer.
- MLA
- Verborgh, Ruben, et al. “Querying Datasets on the Web with High Availability.” Proceedings of the 13th International Semantic Web Conference, edited by Peter Mika et al., vol. 8796, Springer, 2014, pp. 180–96.
Discuss this article
- Discover all publications by Ruben Verborgh.
- Find related articles on Google Scholar.
- Post your questions or comments below.