Substring Filtering for Low-Cost Linked Data Interfaces

Abstract

Recently, Triple Pattern Fragments (tpfs) were introduced as a low-cost server-side interface when high numbers of clients need to evaluate sparql queries. Scalability 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 a literal substring matching feature to the tpf interface, with the goal of improving query performance while maintaining low server cost. In this paper, we discuss the client/server setup and compare the performance of sparql queries on multiple implementations, 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 the substring feature 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.

DOI: 10.1007/978-3-319-25007-6_8

3 Figures and Tables

Cite this paper

@inproceedings{Herwegen2015SubstringFF, title={Substring Filtering for Low-Cost Linked Data Interfaces}, author={Joachim Van Herwegen and Laurens De Vocht and Ruben Verborgh and Erik Mannens and Rik Van de Walle}, booktitle={International Semantic Web Conference}, year={2015} }