Optimizing navigational graph queries
The VLDB Journal · 2025-03 · 34 (2)
DOI: 10.1007/s00778-024-00892-7 ↗Kurz gefasst
Fachartikel in der Zeitschrift The VLDB Journal, online erschienen am 21.01.2025. Verfasst von Thomas Mulder und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We study the optimization of navigational graph queries in the form of the Regular Queries, i.e., queries which combine recursive and pattern-matching fragments. Current approaches to their evaluation are not effective in practice. Towards addressing this, we present a number of novel powerful optimization techniques which aim to constrain the intermediate results during query evaluation. We show how these techniques can be planned effectively and executed efficiently towards the first practical evaluation solution for complex navigational queries on real-world workloads. Indeed, our experimental results show several orders of magnitude improvement in query evaluation performance over state-of-the-art techniques on a wide range of queries on diverse datasets.
Zitieren
APA
Mulder, T., Fletcher, G., & Yakovets, N. (2025). Optimizing navigational graph queries. The VLDB Journal, 34(2). https://doi.org/10.1007/s00778-024-00892-7
Vancouver
Mulder T, Fletcher G, Yakovets N. Optimizing navigational graph queries. The VLDB Journal. 2025;34(2). doi:10.1007/s00778-024-00892-7
BibTeX
@article{Mulder2025,
author = {Mulder, Thomas and Fletcher, George and Yakovets, Nikolay},
title = {Optimizing navigational graph queries},
journal = {The VLDB Journal},
year = {2025},
volume = {34},
number = {2},
doi = {10.1007/s00778-024-00892-7}
}
EUVIMED