Abstract
Link Traversal–based Query Processing (ltqp), in which a sparql query is evaluated over a web of documents rather than a single dataset, is often seen as a theoretically interesting yet impractical technique. However, in a time where the hypercentralization of data has increasingly come under scrutiny, a decentralized Web of Data with a simple document-based interface is appealing, as it enables data publishers to control their data and access rights. While ltqp allows evaluating complex queries over such webs, it suffers from performance issues (due to the high number of documents containing data) as well as information quality concerns (due to the many sources providing such documents). In existing ltqp approaches, the burden of finding sources to query is entirely in the hands of the data consumer. In this paper, we argue that to solve these issues, data publishers should also be able to suggest sources of interest and guide the data consumer towards relevant and trustworthy data. We introduce a theoretical framework that enables such guided link traversal and study its properties. We illustrate with a theoretic example that this can improve query results and reduce the number of network requests.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Notably, this option was also not present in the original work [7].
References
Abiteboul, S., Bienvenu, M., Galland, A., Antoine, É.: A rule-based language for web data management. In: Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, pp. 293–304. ACM (2011)
Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y., et al.: SPARQL web-querying infrastructure: ready for action? In: Alani, H. (ed.) ISWC 2013. LNCS, vol. 8219, pp. 277–293. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41338-4_18
Cyganiak, R., Wood, D., Lanthaler, M.: RDF 1.1: concepts and abstract syntax. Recommendation, W3C, February 2014. https://www.w3.org/TR/2014/REC-rdf11-concepts-20140225/
Hartig, O.: SPARQL for a web of linked data: semantics and computability. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol. 7295, pp. 8–23. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30284-8_8
Hartig, O.: An overview on execution strategies for linked data queries. Datenbank-Spektrum 13(2), 89–99 (2013)
Hartig, O.: SQUIN: a traversal based query execution system for the web of linked data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2013)
Hartig, O.: LDQL: a language for linked data queries. In: Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, 6–8 May 2015. CEUR Workshop Proceedings, vol. 1378. CEUR-WS.org (2015). http://ceur-ws.org/Vol-1378/AMW_2015_paper_34.pdf
Hartig, O., Bizer, C., Freytag, J.-C., et al.: Executing SPARQL queries over the web of linked data. In: Bernstein, A. (ed.) ISWC 2009. LNCS, vol. 5823, pp. 293–309. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04930-9_19
Hartig, O., Freytag, J.C.: Foundations of traversal based query execution over linked data. In: Proceedings of the 23\(^{\text{rd}}\) ACM Conference on Hypertext and Social Media (2012)
Hartig, O., Özsu, M.T., et al.: Walking without a map: ranking-based traversal for querying linked data. In: Groth, P. (ed.) ISWC 2016, Part I. LNCS, vol. 9981, pp. 305–324. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46523-4_19
Hartig, O., Pérez, J.: LDQL: a query language for the web of linked data. J. Web Semant. 41, 9–29 (2016)
Prud’hommeaux, E., Bingham, J.: ShapeTrees specification. Editor’s draft, May 2020. https://shapetrees.github.io/specification/spec
Taelman, R., Van Herwegen, J., Vander Sande, M., Verborgh, R.: Comunica: a modular SPARQL query engine for the web. In: Proceedings of the 17th International Semantic Web Conference, October 2018. https://comunica.github.io/Article-ISWC2018-Resource/
Verborgh, R.: Re-decentralizing the web, for good this time. In: Linking the World’s Information. ACM (to appear)
Verborgh, R., et al.: Triple pattern fragments: a low-cost knowledge graph interface for the Web. J. Web Semant. 37–38, 184–206 (2016)
Wylot, M., Cudré-Mauroux, P., Groth, P.: Executing provenance-enabled queries over web data. In: Proceedings of the 24\(^{\text{ th }}\) International Conference on World Wide Web (2015)
Acknowledgements
This research received funding from the Flemish Government under the “Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen” programme. Ruben Taelman and Ruben Verborgh are postdoctoral fellows of the Research Foundation – Flanders (FWO) (1274521N). Heba Aamer is supported by the Special Research Fund (BOF) (BOF19OWB16).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Bogaerts, B., Ketsman, B., Zeboudj, Y., Aamer, H., Taelman, R., Verborgh, R. (2021). Link Traversal with Distributed Subweb Specifications. In: Moschoyiannis, S., Peñaloza, R., Vanthienen, J., Soylu, A., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2021. Lecture Notes in Computer Science(), vol 12851. Springer, Cham. https://doi.org/10.1007/978-3-030-91167-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-91167-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91166-9
Online ISBN: 978-3-030-91167-6
eBook Packages: Computer ScienceComputer Science (R0)