Interactive Comparison of Triple Pattern Fragments Query Approaches
In order to reduce the server-side cost of publishing queryable Linked Data, Triple Pattern Fragments (TPF) were introduced as a simple interface to RDF triples. They allow for SPARQL query execution at low server cost, by partially shifting the load from servers to clients. The previously proposed query execution algorithm provides a solution that is highly inefficient, often requiring an amount of http calls that is magnitudes larger than the optimal solution. We have proposed a new query execution algorithm with the aim to solve this problem. Our solution significantly improves on the current work by maintaining a complete overview of the query instead of just looking at local optima. In this paper, we describe a demo that allows a user to easily compare the results of both implementations. We show both query results and number of executed http calls, proving a clear picture of the difference between the two algorithms.
full text BibTeX other citation formats
Published in 2015 in Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos.
- RDF
- Linked Data
- Triple Pattern Fragments
- SPARQL
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{vanherwegen_eswc_demo_2015,
author = {Van Herwegen, Joachim and Verborgh, Ruben and Mannens, Erik and Van de Walle, Rik},
title = {Interactive Comparison of {Triple Pattern Fragments} Query Approaches},
booktitle = {Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos},
series = {Lecture Notes in Computer Science},
editor = {Gandon, Fabien and Gu\'eret, Christophe and Villata, Serena and Breslin, John and Faron-Zucker, Catherine and Zimmermann, Antoine},
volume = 9341,
pages = {165--168},
year = 2015,
month = jun,
publisher = {Springer},
isbn = {978-3-319-25639-9},
doi = {10.1007/978-3-319-25639-9_32},
url = {http://dx.doi.org/10.1007/978-3-319-25639-9_32},
}
Alternatively, pick a reference of your choice below:
- ACM
- Joachim Van Herwegen, Ruben Verborgh, Erik Mannens, and Rik Van de Walle. 2015. Interactive Comparison of Triple Pattern Fragments Query Approaches. In Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos (Lecture Notes in Computer Science), Springer, 165–168.
- APA
- Van Herwegen, J., Verborgh, R., Mannens, E., & Van de Walle, R. (2015). Interactive Comparison of Triple Pattern Fragments Query Approaches. In F. Gandon, C. Guéret, S. Villata, J. Breslin, C. Faron-Zucker, & A. Zimmermann (Eds.), Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos (Vol. 9341, pp. 165–168). Springer.
- IEEE
- J. Van Herwegen, R. Verborgh, E. Mannens, and R. Van de Walle, “Interactive Comparison of Triple Pattern Fragments Query Approaches,” in Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos, 2015, vol. 9341, pp. 165–168.
- LNCS
- Van Herwegen, J., Verborgh, R., Mannens, E., Van de Walle, R.: Interactive Comparison of Triple Pattern Fragments Query Approaches. In: Gandon, F., Guéret, C., Villata, S., Breslin, J., Faron-Zucker, C., and Zimmermann, A. (eds.) Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos. pp. 165–168. Springer (2015).
- MLA
- Van Herwegen, Joachim, et al. “Interactive Comparison of Triple Pattern Fragments Query Approaches.” Proceedings of the 12th Extended Semantic Web Conference: Posters and Demos, edited by Fabien Gandon et al., vol. 9341, Springer, 2015, pp. 165–68.
Discuss this article
- Discover all publications by Ruben Verborgh.
- Find related articles on Google Scholar.
- Post your questions or comments below.