Query Execution Optimization for Clients of Triple Pattern Fragments
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 uses more http requests than necessary, and only makes partial use of the available metadata. In this paper, we propose a new query execution algorithm for a client communicating with a TPF server. In contrast to a greedy solution, we maintain an overview of the entire query to find the optimal steps for solving a given query. We show multiple cases in which our algorithm reaches solutions with far fewer http requests, without significantly increasing the cost in other cases. This improves the efficiency of common SPARQL queries against TPF interfaces, augmenting their viability compared to the more powerful, but more costly, SPARQL interface.
full text BibTeX other citation formats
Published in 2015 in The Semantic Web: Latest Advances and New Domains (ESWC2015).
- RDF
- Linked Data
- Triple Pattern Fragments
- SPARQL
- metadata
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_2015,
author = {Van Herwegen, Joachim and Verborgh, Ruben and Mannens, Erik and Van de Walle, Rik},
booktitle = {The Semantic Web: Latest Advances and New Domains (ESWC2015)},
title = {Query Execution Optimization for Clients of {Triple Pattern Fragments}},
series = {Lecture Notes in Computer Science},
editor = {Gandon, Fabien and Sabou, Marta and Sack, Harald and d'Amato, Claudia and Cudr\'e-Mauroux, Philippe and Zimmermann, Antoine},
volume = 9088,
pages = {302--318},
year = 2015,
month = may,
url = {https://linkeddatafragments.org/publications/eswc2015.pdf},
}
Alternatively, pick a reference of your choice below:
- ACM
- Joachim Van Herwegen, Ruben Verborgh, Erik Mannens, and Rik Van de Walle. 2015. Query Execution Optimization for Clients of Triple Pattern Fragments. In The Semantic Web: Latest Advances and New Domains (ESWC2015) (Lecture Notes in Computer Science), 302–318.
- APA
- Van Herwegen, J., Verborgh, R., Mannens, E., & Van de Walle, R. (2015). Query Execution Optimization for Clients of Triple Pattern Fragments. In F. Gandon, M. Sabou, H. Sack, C. d’Amato, P. Cudré-Mauroux, & A. Zimmermann (Eds.), The Semantic Web: Latest Advances and New Domains (ESWC2015) (Vol. 9088, pp. 302–318).
- IEEE
- J. Van Herwegen, R. Verborgh, E. Mannens, and R. Van de Walle, “Query Execution Optimization for Clients of Triple Pattern Fragments,” in The Semantic Web: Latest Advances and New Domains (ESWC2015), 2015, vol. 9088, pp. 302–318.
- LNCS
- Van Herwegen, J., Verborgh, R., Mannens, E., Van de Walle, R.: Query Execution Optimization for Clients of Triple Pattern Fragments. In: Gandon, F., Sabou, M., Sack, H., d’Amato, C., Cudré-Mauroux, P., and Zimmermann, A. (eds.) The Semantic Web: Latest Advances and New Domains (ESWC2015). pp. 302–318 (2015).
- MLA
- Van Herwegen, Joachim, et al. “Query Execution Optimization for Clients of Triple Pattern Fragments.” The Semantic Web: Latest Advances and New Domains (ESWC2015), edited by Fabien Gandon et al., vol. 9088, 2015, pp. 302–18.
Discuss this article
- Discover all publications by Ruben Verborgh.
- Find related articles on Google Scholar.
- Post your questions or comments below.