{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:17Z","timestamp":1747173677373,"version":"3.40.5"},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:00:00Z","timestamp":1682380800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link traversal\u2013based query processing (<jats:sc>ltqp<\/jats:sc>), in which a <jats:sc>sparql<\/jats:sc> 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 (<jats:sc>ltqp<\/jats:sc> 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 <jats:sc>ltqp<\/jats:sc> approaches, the burden of finding sources to query is entirely in the hands of the <jats:italic>data consumer<\/jats:italic>. In this paper, we argue that to solve these issues, <jats:italic>data publishers<\/jats:italic> should also be able to suggest sources of interest and <jats:italic>guide<\/jats:italic> the data consumer toward 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. We evaluate our proposal experimentally on a virtual linked web with specifications and indeed observe that not just the data quality but also the efficiency of querying improves.<\/jats:p>","DOI":"10.1017\/s1471068423000054","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T06:36:37Z","timestamp":1682404597000},"page":"394-420","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Subweb Specifications for Traversing the Web"],"prefix":"10.1017","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3460-4251","authenticated-orcid":false,"given":"BART","family":"BOGAERTS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BAS","family":"KETSMAN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YOUNES","family":"ZEBOUDJ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HEBA","family":"AAMER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RUBEN","family":"TAELMAN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RUBEN","family":"VERBORGH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"S1471068423000054_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00052-3"},{"key":"S1471068423000054_ref6","unstructured":"Capadisli, S. 2022. Web access control. Editor\u2019s draft, Solid."},{"key":"S1471068423000054_ref10","unstructured":"Coburn, A. , Pavlik, E. and Zagidulin, D. 2022. Solid-oidc. Editor\u2019s draft, Solid."},{"key":"S1471068423000054_ref4","unstructured":"Bosquet, M. 2022. Access control policy (ACP). Editor\u2019s draft, Solid."},{"key":"S1471068423000054_ref23","unstructured":"Prud\u2019hommeaux, E. and Bingham, J. 2021. Shape trees specification. Editor\u2019s draft., W3C."},{"key":"S1471068423000054_ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989320"},{"key":"S1471068423000054_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2009.04.002"},{"key":"S1471068423000054_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00668-6_15"},{"key":"S1471068423000054_ref29","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3199223"},{"key":"S1471068423000054_ref22","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.387"},{"key":"S1471068423000054_ref12","doi-asserted-by":"crossref","unstructured":"Erling, O. , Averbuch, A. , Larriba-Pey, J. , Chafi, H. , Gubichev, A. , Prat, A. , Pham, M.-D. and Boncz, P. 2015. The LDBC social network benchmark: Interactive workload. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 619\u2013630.","DOI":"10.1145\/2723372.2742786"},{"key":"S1471068423000054_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465231"},{"key":"S1471068423000054_ref20","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3199269"},{"key":"S1471068423000054_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-013-0122-1"},{"key":"S1471068423000054_ref11","unstructured":"Cyganiak, R. , Wood, D. and Lanthaler, M. 2014. rdf 1.1: Concepts and abstract syntax. Recommendation, w3 c."},{"key":"S1471068423000054_ref7","unstructured":"Capadisli, S. and Berners-Lee, T. 2022. Solid webid profile. Editor\u2019s draft, Solid."},{"key":"S1471068423000054_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/296854.277639"},{"key":"S1471068423000054_ref3","doi-asserted-by":"crossref","unstructured":"Bogaerts, B. , Ketsman, B. , Zeboudj, Y. , Aamer, H. , Taelman, R. and Verborgh, R. Link traversal with distributed subweb specifications. In Rules and Reasoning - 5th International Joint Conference, RuleML+RR 2021, Leuven, Belgium, September 13-15, 2021, Proceedings 2021, Moschoyiannis, S. , Pe\u00f1aloza, R. , Vanthienen, J. , Soylu, A. , and Roman, D. , Eds., vol. 12851. Lecture Notes in Computer Science. Springer, 62\u201379.","DOI":"10.1007\/978-3-030-91167-6_5"},{"key":"S1471068423000054_ref16","unstructured":"Hartig, O. 2015. LDQL: A language for linked data queries. In Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6-8, 2015, vol. 1378. CEUR Workshop Proceedings. CEUR-WS.org."},{"key":"S1471068423000054_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30284-8_8"},{"key":"S1471068423000054_ref31","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v12i1.14988"},{"key":"S1471068423000054_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741143"},{"key":"S1471068423000054_ref8","unstructured":"Capadisli, S. , Berners-Lee, T. , Verborgh, R. and Kjernsmo, K. 2020. Solid protocol. Editor\u2019s draft, Solid."},{"key":"S1471068423000054_ref27","unstructured":"Turdean, T. 2022. Type indexes. Editor\u2019s draft, Solid."},{"key":"S1471068423000054_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_19"},{"key":"S1471068423000054_ref19","doi-asserted-by":"crossref","unstructured":"Hartig, O. and \u00d6zsu, M. T. 2016. Walking without a map: Ranking-based traversal for querying linked data. In Proceedings of ISWC 2016, Part I, 305\u2013324.","DOI":"10.1007\/978-3-319-46523-4_19"},{"key":"S1471068423000054_ref24","unstructured":"Speicher, S. , Arwe, J. and Malhotra, A. 2015. Linked data platform 1.0. Rec., W3C."},{"key":"S1471068423000054_ref26","unstructured":"Taelman, R. and Verborgh, R. 2022. A prospective analysis of security vulnerabilities within link traversal-based query processing. In Proceedings of the 6th International Workshop on Storing, Querying and Benchmarking Knowledge Graphs."},{"volume-title":"Linking the World\u2019s Information","year":"2020","author":"Verborgh","key":"S1471068423000054_ref28"},{"key":"S1471068423000054_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2309996.2310005"},{"key":"S1471068423000054_ref5","doi-asserted-by":"crossref","unstructured":"Buil-Aranda, C. , Hogan, A. , Umbrich, J. and Vandenbussche, P.-Y. 2013. sparql Web-querying infrastructure: Ready for action? In Proceedings of the 12th International Semantic Web Conference 2013, vol. 8219. Lecture Notes in Computer Science. Springer, 277\u2013293.","DOI":"10.1007\/978-3-642-41338-4_18"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068423000054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T04:15:38Z","timestamp":1710303338000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068423000054\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,25]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["S1471068423000054"],"URL":"https:\/\/doi.org\/10.1017\/s1471068423000054","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2023,4,25]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}