[Profile picture of Ruben Verborgh]

Ruben Verborgh

Link Traversal over Decentralised Environments using Restart-Based Query Planning

Jonni Hanski, Ruben Taelman, and Ruben Verborgh

With the emergence of decentralisation initiatives to address various issues around regulatory compliance and barriers of entry to data-driven markets, data access abstraction layers in the form of query engines are needed to assist in developing services on top of such environments. Prior work, however, has demonstrated significant network overhead during data retrieval in traversal-based query execution over decentralised Linked Data sources, dwarfing the relative impact of local processing and query optimisations. Certain decentralisation initiatives, however, offer an environment with seemingly sufficient structure to address this, allowing client-side query engines to attain measurable performance improvements through local optimisations. One example is the Solid initiative, offering distributed well-defined user data stores, helping traversal-based query execution approaches in efficiently locating and accessing query-relevant data. Within this work, we demonstrate the impact of client-side adaptive query planning optimisations within structured distributed environments, using the Solid ecosystem as an example, to highlight the potential for tangible improvements in traversal-based execution. Through the implementation of a restart-based query planning technique, we achieve average query execution time reductions of up to 36% compared to a baseline of unchanged query plan execution. Conversely, we also demonstrate how such techniques, when applied without robust cost-benefit estimation, can effectively double the query execution time. This illustrates the importance and potential of client-side techniques even in such distributed environments, and highlights the importance of further investigation in the direction of these techniques.

full text BibTeX other citation formats

Published in 2025 in Proceedings of the 25th International Conference on Web Engineering.

Keywords:

Read this article online

Cite this article in your work

Cite this article easily using its BibTeX entry: 

@inproceedings{hanski_icwe_2025,
  author = {Hanski, Jonni and Taelman, Ruben and Verborgh, Ruben},
  title = {Link Traversal over Decentralised Environments using Restart-Based Query Planning},
  booktitle = {Proceedings of the 25th International Conference on Web Engineering},
  year = 2025,
  month = jun,
  url = {https://www.rubensworks.net/raw/publications/2025/hanski_icwe_restart_2025.pdf},
}

Alternatively, pick a reference of your choice below:

ACM
Jonni Hanski, Ruben Taelman, and Ruben Verborgh. 2025. Link Traversal over Decentralised Environments using Restart-Based Query Planning. In Proceedings of the 25th International Conference on Web Engineering.
APA
Hanski, J., Taelman, R., & Verborgh, R. (2025, June). Link Traversal over Decentralised Environments using Restart-Based Query Planning. Proceedings of the 25th International Conference on Web Engineering.
IEEE
J. Hanski, R. Taelman, and R. Verborgh, “Link Traversal over Decentralised Environments using Restart-Based Query Planning,” in Proceedings of the 25th International Conference on Web Engineering, 2025.
LNCS
Hanski, J., Taelman, R., Verborgh, R.: Link Traversal over Decentralised Environments using Restart-Based Query Planning. In: Proceedings of the 25th International Conference on Web Engineering (2025).
MLA
Hanski, Jonni, et al. “Link Traversal over Decentralised Environments Using Restart-Based Query Planning.” Proceedings of the 25th International Conference on Web Engineering, 2025.

Discuss this article