{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:33:31Z","timestamp":1761806011094,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095268","type":"print"},{"value":"9783032095275","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09527-5_31","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:28:40Z","timestamp":1761805720000},"page":"575-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Link Prioritization for\u00a0Efficient Traversal in\u00a0Structured Decentralized Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6475-806X","authenticated-orcid":false,"given":"Ruben","family":"Eschauzier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5118-256X","authenticated-orcid":false,"given":"Ruben","family":"Taelman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8596-222X","authenticated-orcid":false,"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-25007-6_7","volume-title":"The Semantic Web - ISWC 2015","author":"M Acosta","year":"2015","unstructured":"Acosta, M., Vidal, M.-E.: Networks of linked data eddies: an adaptive web query processing engine for RDF data. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 111\u2013127. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25007-6_7"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-68204-4_1","volume-title":"The Semantic Web \u2013 ISWC 2017","author":"M Acosta","year":"2017","unstructured":"Acosta, M., Vidal, M.-E., Sure-Vetter, Y.: Diefficiency metrics: measuring the continuous efficiency of query processing approaches. In: d\u2019Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10588, pp. 3\u201319. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68204-4_1"},{"key":"31_CR3","unstructured":"Aniebo, O.C.: Quantitative Assessment of the Relationship between e\/m-Commerce Site Access Speed and Consumer Adoption-Retention Rate. PhD thesis, Northcentral University (2020)"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The berlin sparql benchmark. Int. J. Semant. Web Inf. Syst. (IJSWIS) 5(2), 1\u201324 (2009)","journal-title":"Int. J. Semant. Web Inf. Syst. (IJSWIS)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-44503-X_20","volume-title":"Database Theory \u2014 ICDT 2001","author":"P Buneman","year":"2001","unstructured":"Buneman, P., Khanna, S., Wang-Chiew, T.: Why and where: a characterization of data provenance. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 316\u2013330. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44503-X_20"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T.-Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed steiner problems. J. Algor. 33(1), 73\u201391 (1999)","journal-title":"J. Algor."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Dang, M.H., Aimonier-Davat, J., Molli, P., Hartig, O., Skaf-Molli, H., Crom, Y.L.: Fedshop: a benchmark for testing the scalability of sparql federation engines. In: International Semantic Web Conference, pp. 285\u2013301. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-47243-5_16"},{"key":"31_CR8","unstructured":"Eschauzier, R., Taelman, R., Verborgh, R.: How does the link queue evolve during traversal-based query processing? In: QuWeDa\/MEPDaW@ ISWC, pp. 26\u201333 (2023)"},{"key":"31_CR9","unstructured":"Eschauzier R., Taelman, R., Verborgh, R.: The r3 metric: measuring performance of link prioritization during traversal-based query processing. In: Proceedings of the 16th Alberto Mendelzon International Workshop on Foundations of Data Management (2024)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Esteves, B., Pandit, H.J., Rodr\u00edguez-Doncel, V.: Odrl profile for expressing consent through granular access control policies in solid. In: 2021 IEEE European Symposium on Security and Privacy Workshops (EuroS &PW), pp. 298\u2013306. IEEE (2021)","DOI":"10.1109\/EuroSPW54576.2021.00038"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-9-82","volume":"9","author":"M Fourment","year":"2008","unstructured":"Fourment, M., Gillings, M.R.: A comparison of common programming languages used in bioinformatics. BMC Bioinf. 9, 1\u20139 (2008)","journal-title":"BMC Bioinf."},{"issue":"2\u20133","key":"31_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: Lubm: a benchmark for owl knowledge base systems. J. Web Semant. 3(2\u20133), 158\u2013182 (2005)","journal-title":"J. Web Semant."},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-21034-1_11","volume-title":"The Semantic Web: Research and Applications","author":"O Hartig","year":"2011","unstructured":"Hartig, O.: Zero-knowledge query planning for an iterator implementation of link traversal based query execution. In: Antoniou, G., et al. (eds.) ESWC 2011. LNCS, vol. 6643, pp. 154\u2013169. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21034-1_11"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Hartig, O.: Squin: a traversal based query execution system for the web of linked data. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 1081\u20131084 (2013)","DOI":"10.1145\/2463676.2465231"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-04930-9_19","volume-title":"The Semantic Web - ISWC 2009","author":"O Hartig","year":"2009","unstructured":"Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL queries over the web of linked data. In: Bernstein, A., et al. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293\u2013309. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04930-9_19"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Hartig, O., Freytag, J.C.: Foundations of traversal based query execution over linked data. In: Proceedings of the 23rd ACM Conference on Hypertext and Social Media, pp. 43\u201352 (2012)","DOI":"10.1145\/2309996.2310005"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-46523-4_19","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"O Hartig","year":"2016","unstructured":"Hartig, O., \u00d6zsu, M.T.: Walking without a map: ranking-based traversal for querying linked data. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 305\u2013324. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46523-4_19"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Heling, L., Acosta, M.: Federated sparql query processing over heterogeneous linked data fragments. In: Proceedings of the ACM Web Conference, vol. 2022, pp. 1047\u20131057 (2022)","DOI":"10.1145\/3485447.3511947"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"50 Years of Integer Programming 1958-2008","author":"RM Karp","year":"2010","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958-2008, pp. 219\u2013241. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_8"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-21034-1_10","volume-title":"The Semantic Web: Research and Applications","author":"G Ladwig","year":"2011","unstructured":"Ladwig, G., Tran, T.: SIHJoin: querying remote and local linked data. In: Antoniou, G., et al. (eds.) ESWC 2011. LNCS, vol. 6643, pp. 139\u2013153. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21034-1_10"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Le, W., Kementsietsidis, A., Duan, S., Li, F.: Scalable multi-query optimization for sparql. In: 2012 IEEE 28th International Conference on Data Engineering, pp. 666\u2013677. IEEE (2012)","DOI":"10.1109\/ICDE.2012.37"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Le\u00a0Hors, A.J., Speicher, S.: The linked data platform (ldp). In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1\u20132 (2013)","DOI":"10.1145\/2487788.2487790"},{"key":"31_CR23","unstructured":"Miranker, D.P., Depena, R.K., Jung, H., Sequeda, J.F., Reyna, C.: Diamond: a sparql query engine, for linked data based on the rete match. In: AImWD 2012, p.\u00a07 (2012)"},{"key":"31_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-35173-0_21","volume-title":"The Semantic Web \u2013 ISWC 2012","author":"G Montoya","year":"2012","unstructured":"Montoya, G., Vidal, M.-E., Corcho, O., Ruckhaus, E., Buil-Aranda, C.: Benchmarking federated SPARQL query engines: are existing testbeds enough? In: Cudr\u00e9-Mauroux, P., et al. (eds.) ISWC 2012. LNCS, vol. 7650, pp. 313\u2013324. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35173-0_21"},{"key":"31_CR25","unstructured":"Padia, A., Finin, T., Joshi, A., et\u00a0al.: Attribute-based fine grained access control for triple stores. In: 3rd Society, Privacy and the Semantic Web-Policy and Technology workshop, 14th International Semantic Web Conference (2015)"},{"key":"31_CR26","unstructured":"Page, L.: The pagerank citation ranking: Bringing order to the web. Technical report (1999)"},{"issue":"3","key":"31_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1567274.1567278","volume":"34","author":"J P\u00e9rez","year":"2009","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of sparql. ACM Trans. Datab. Syst. (TODS) 34(3), 1\u201345 (2009)","journal-title":"ACM Trans. Datab. Syst. (TODS)"},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"Raman, A., Joglekar, S., De Cristofaro, E., Sastry, N., Tyson, G.: Challenges in the decentralised web: the mastodon case. In: Proceedings of the Internet Measurement Conference, pp. 217\u2013229 (2019)","DOI":"10.1145\/3355369.3355572"},{"issue":"5","key":"31_CR29","first-page":"493","volume":"7","author":"M Saleem","year":"2016","unstructured":"Saleem, M., Khan, Y., Hasnain, A., Ermilov, I., Ngomo, A.C.N.: A fine-grained evaluation of sparql endpoint federation systems. Semant. Web 7(5), 493\u2013518 (2016)","journal-title":"Semant. Web"},{"key":"31_CR30","unstructured":"Sambra, A.V., et al.: Solid: a platform for decentralized social applications based on linked data. MIT CSAIL & Qatar Computing Research Institute, Technical Report (2016)"},{"key":"31_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-25073-6_37","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"M Schmidt","year":"2011","unstructured":"Schmidt, M., G\u00f6rlitz, O., Haase, P., Ladwig, G., Schwarte, A., Tran, T.: FedBench: a benchmark suite for federated semantic data query processing. In: Aroyo, L., et al. (eds.) ISWC 2011. LNCS, vol. 7031, pp. 585\u2013600. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25073-6_37"},{"key":"31_CR32","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Meier, M., Lausen, G.: Foundations of sparql query optimization. In: Proceedings of the 13th International Conference on Database Theory, pp. 4\u201333 (2010)","DOI":"10.1145\/1804669.1804675"},{"key":"31_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-642-25073-6_38","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"A Schwarte","year":"2011","unstructured":"Schwarte, A., Haase, P., Hose, K., Schenkel, R., Schmidt, M.: FedX: optimization techniques for federated query processing on linked data. In: Aroyo, L., et al. (eds.) ISWC 2011. LNCS, vol. 7031, pp. 601\u2013616. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25073-6_38"},{"key":"31_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-00668-6_15","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"R Taelman","year":"2018","unstructured":"Taelman, R., Van Herwegen, J., Vander Sande, M., Verborgh, R.: Comunica: a modular SPARQL query engine for the web. In: Vrande\u010di\u0107, D., et al. (eds.) ISWC 2018. LNCS, vol. 11137, pp. 239\u2013255. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00668-6_15"},{"key":"31_CR35","doi-asserted-by":"publisher","unstructured":"Taelman, R., Verborgh, R.: Link traversal query processing over decentralized environments with structural assumptions. In: International Semantic Web Conference, pp. 3\u201322. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-47240-4_1","DOI":"10.1007\/978-3-031-47240-4_1"},{"key":"31_CR36","unstructured":"Tam, B.E., Taelman, R., Colpaert, P., Verborgh, R.: Opportunities for shape-based optimization of link traversal queries. arXiv preprint arXiv:2407.00998 (2024)"},{"issue":"2","key":"31_CR37","first-page":"16","volume":"48","author":"M Tarafdar","year":"2008","unstructured":"Tarafdar, M., Zhang, J.: Determinants of reach and loyalty\u2014a study of website performance and implications for website design. J. Comput. Inf. Syst. 48(2), 16\u201324 (2008)","journal-title":"J. Comput. Inf. Syst."},{"key":"31_CR38","unstructured":"Turdean, T: Type indexes. Solid (2022). https:\/\/solid.github.io\/type-indexes\/"},{"key":"31_CR39","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","volume":"37","author":"R Verborgh","year":"2016","unstructured":"Verborgh, R., et al.: Triple pattern fragments: a low-cost knowledge graph interface for the web. J. Web Semant. 37, 184\u2013206 (2016)","journal-title":"J. Web Semant."},{"key":"31_CR40","unstructured":"W3C. Activitypub: A decentralized social networking protocol. https:\/\/www.w3.org\/TR\/activitypub\/. W3C Recommendation (2018)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09527-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:28:46Z","timestamp":1761805726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09527-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"ISBN":["9783032095268","9783032095275"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09527-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"29 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The main repository with links to all code needed to replicate the results is available on GitHub:\n                      \n                      . The raw experimental data and full version of the paper\u2019s figure can be found on Zenodo:\n                      \n                      . The query templates used to benchmark the algorithms are found on GitHub:\n                      \n                      .","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Supplemental Material Statement"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2025.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}