Opportunistic linked data querying through approximate membership metadata
- Author
- Miel Vander Sande (UGent) , Ruben Verborgh (UGent) , Joachim Van Herwegen (UGent) , Erik Mannens (UGent) and Rik Van de Walle (UGent)
- Organization
- Abstract
- Between URI dereferencing and the SPARQL protocol lies a largely unexplored axis of possible interfaces to Linked Data, each with its own combination of trade-offs. One of these interfaces is Triple Pattern Fragments, which allows clients to execute SPARQL queries against low-cost servers, at the cost of higher bandwidth. Increasing a client's efficiency means lowering the number of requests, which can among others be achieved through additional metadata in responses. We noted that typical SPARQL query evaluations against Triple Pattern Fragments require a significant portion of membership subqueries, which check the presence of a specific triple, rather than a variable pattern. This paper studies the impact of providing approximate membership functions, i.e., Bloom filters and Golomb-coded sets, as extra metadata. In addition to reducing HTTP requests, such functions allow to achieve full result recall earlier when temporarily allowing lower precision. Half of the tested queries from a WatDiv benchmark test set could be executed with up to a third fewer HTTP requests with only marginally higher server cost. Query times, however, did not improve, likely due to slower metadata generation and transfer. This indicates that approximate membership functions can partly improve the client-side query process with minimal impact on the server and its interface.
- Keywords
- Scalability, SPARQL, Availability, Linked data, Querying
Downloads
-
2015 - Miel Vander Sande et al. - Opportunistic Linked Data querying through approximate membership metadata.pdf
- full text
- |
- open access
- |
- |
- 684.26 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8030816
- MLA
- Vander Sande, Miel, et al. “Opportunistic Linked Data Querying through Approximate Membership Metadata.” Lecture Notes in Computer Science, vol. 9366, SPRINGER INT PUBLISHING AG, 2015, pp. 92–110, doi:10.1007/978-3-319-25007-6_6.
- APA
- Vander Sande, M., Verborgh, R., Van Herwegen, J., Mannens, E., & Van de Walle, R. (2015). Opportunistic linked data querying through approximate membership metadata. Lecture Notes in Computer Science, 9366, 92–110. https://doi.org/10.1007/978-3-319-25007-6_6
- Chicago author-date
- Vander Sande, Miel, Ruben Verborgh, Joachim Van Herwegen, Erik Mannens, and Rik Van de Walle. 2015. “Opportunistic Linked Data Querying through Approximate Membership Metadata.” In Lecture Notes in Computer Science, 9366:92–110. CHAM: SPRINGER INT PUBLISHING AG. https://doi.org/10.1007/978-3-319-25007-6_6.
- Chicago author-date (all authors)
- Vander Sande, Miel, Ruben Verborgh, Joachim Van Herwegen, Erik Mannens, and Rik Van de Walle. 2015. “Opportunistic Linked Data Querying through Approximate Membership Metadata.” In Lecture Notes in Computer Science, 9366:92–110. CHAM: SPRINGER INT PUBLISHING AG. doi:10.1007/978-3-319-25007-6_6.
- Vancouver
- 1.Vander Sande M, Verborgh R, Van Herwegen J, Mannens E, Van de Walle R. Opportunistic linked data querying through approximate membership metadata. In: Lecture Notes in Computer Science. CHAM: SPRINGER INT PUBLISHING AG; 2015. p. 92–110.
- IEEE
- [1]M. Vander Sande, R. Verborgh, J. Van Herwegen, E. Mannens, and R. Van de Walle, “Opportunistic linked data querying through approximate membership metadata,” in Lecture Notes in Computer Science, Bethlehem, PA, 2015, vol. 9366, pp. 92–110.
@inproceedings{8030816,
abstract = {{Between URI dereferencing and the SPARQL protocol lies a largely unexplored axis of possible interfaces to Linked Data, each with its own combination of trade-offs. One of these interfaces is Triple Pattern Fragments, which allows clients to execute SPARQL queries against low-cost servers, at the cost of higher bandwidth. Increasing a client's efficiency means lowering the number of requests, which can among others be achieved through additional metadata in responses. We noted that typical SPARQL query evaluations against Triple Pattern Fragments require a significant portion of membership subqueries, which check the presence of a specific triple, rather than a variable pattern. This paper studies the impact of providing approximate membership functions, i.e., Bloom filters and Golomb-coded sets, as extra metadata. In addition to reducing HTTP requests, such functions allow to achieve full result recall earlier when temporarily allowing lower precision. Half of the tested queries from a WatDiv benchmark test set could be executed with up to a third fewer HTTP requests with only marginally higher server cost. Query times, however, did not improve, likely due to slower metadata generation and transfer. This indicates that approximate membership functions can partly improve the client-side query process with minimal impact on the server and its interface.}},
author = {{Vander Sande, Miel and Verborgh, Ruben and Van Herwegen, Joachim and Mannens, Erik and Van de Walle, Rik}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{978-3-319-25006-9}},
issn = {{0302-9743}},
keywords = {{Scalability,SPARQL,Availability,Linked data,Querying}},
language = {{eng}},
location = {{Bethlehem, PA}},
pages = {{92--110}},
publisher = {{SPRINGER INT PUBLISHING AG}},
title = {{Opportunistic linked data querying through approximate membership metadata}},
url = {{http://doi.org/10.1007/978-3-319-25007-6_6}},
volume = {{9366}},
year = {{2015}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: