[Profile picture of Ruben Verborgh]

Ruben Verborgh

Substring Filtering for Low-Cost Linked Data Interfaces

Joachim Van Herwegen, Laurens De Vocht, Ruben Verborgh, Erik Mannens, and Rik Van de Walle

Recently, Triple Pattern Fragments (TPFs) were introduced as an alternative to reduce server load when high numbers of clients need to evaluate SPARQL queries. This is achieved by moving part of the query execution to the client, at the cost of elevated query times. Since the TPF interface purposely does not support complex constructs such as SPARQL filters, queries that use them need to be executed mostly on the client, resulting in long execution times. We therefore investigated the impact of adding literal substring matching to the interface, with the goal of improving query performance while maintaining low server cost. In this paper, we discuss the client/server setup and compare performance of SPARQL queries on multiple implementations with existing solutions, including Elastic Search and case-insensitive FM-index. Our evaluations indicate that these improvements allow for faster query execution without significantly increasing the load on the server. Offering these additions on TPF servers allows users to obtain faster responses for filter-based SPARQL queries. Furthermore, substring matching can be used to support other filters such as complete regular expressions or range queries.

full text BibTeX other citation formats

Published in 2015 in Proceedings of the 14th International Semantic Web Conference.

Keywords:

Read this article online

Cite this article in your work

Cite this article easily using its BibTeX entry: 

@inproceedings{vanherwegen_iswc_2015,
  author = {Van Herwegen, Joachim and De Vocht, Laurens and Verborgh, Ruben and Mannens, Erik and Van de Walle, Rik},
  title = {Substring Filtering for Low-Cost {Linked Data} Interfaces},
  booktitle = {Proceedings of the 14th International Semantic Web Conference},
  editor = {Arenas, Marcelo and Corcho, Oscar and Simperl, Elena and Strohmaier, Markus and d'Aquin, Mathieu and Srinivas, Kavitha and Groth, Paul and Dumontier, Michel and Heflin, Jeff and Thirunarayan, Krishnaprasad and Staab, Steffen},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = 9366,
  pages = {128--143},
  year = 2015,
  month = oct,
  url = {https://linkeddatafragments.org/publications/iswc2015-substring.pdf},
}

Alternatively, pick a reference of your choice below:

ACM
Joachim Van Herwegen, Laurens De Vocht, Ruben Verborgh, Erik Mannens, and Rik Van de Walle. 2015. Substring Filtering for Low-Cost Linked Data Interfaces. In Proceedings of the 14th International Semantic Web Conference (Lecture Notes in Computer Science), Springer, 128–143.
APA
Van Herwegen, J., De Vocht, L., Verborgh, R., Mannens, E., & Van de Walle, R. (2015). Substring Filtering for Low-Cost Linked Data Interfaces. In M. Arenas, O. Corcho, E. Simperl, M. Strohmaier, M. d’Aquin, K. Srinivas, P. Groth, M. Dumontier, J. Heflin, K. Thirunarayan, & S. Staab (Eds.), Proceedings of the 14th International Semantic Web Conference (Vol. 9366, pp. 128–143). Springer.
IEEE
J. Van Herwegen, L. De Vocht, R. Verborgh, E. Mannens, and R. Van de Walle, “Substring Filtering for Low-Cost Linked Data Interfaces,” in Proceedings of the 14th International Semantic Web Conference, 2015, vol. 9366, pp. 128–143.
LNCS
Van Herwegen, J., De Vocht, L., Verborgh, R., Mannens, E., Van de Walle, R.: Substring Filtering for Low-Cost Linked Data Interfaces. In: Arenas, M., Corcho, O., Simperl, E., Strohmaier, M., d’Aquin, M., Srinivas, K., Groth, P., Dumontier, M., Heflin, J., Thirunarayan, K., and Staab, S. (eds.) Proceedings of the 14th International Semantic Web Conference. pp. 128–143. Springer (2015).
MLA
Van Herwegen, Joachim, et al. “Substring Filtering for Low-Cost Linked Data Interfaces.” Proceedings of the 14th International Semantic Web Conference, edited by Marcelo Arenas et al., vol. 9366, Springer, 2015, pp. 128–43.

Discuss this article