DBScholar

Back to papers

Robust Recursive Query Parallelism in Graph Database Management Systems

Summary: Defines a morsel-dispatching design space unifying source-, frontier-, and multi-source BFS parallelisms for recursive graph queries. Implements a hybrid source+frontier morsel policy with multi-source packing in Kuzu, empirically achieving robust multi-core scaling and scan reduction when many sources exist. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h1e0808362b8e86a5
Venue
VLDB
Year
2025
Pagerank
5.3942942e-05
Overall Rank
8,071 | 45.74%
DOI
10.14778/3749646.3749706

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{chakraborty_vldb25,
        title = {{Robust Recursive Query Parallelism in Graph Database Management Systems}},
        author = {Chakraborty, Anurag and Salihoğlu, Semih},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {11},
        pages = {4465--4477},
        doi = {10.14778/3749646.3749706},
        url = {https://doi.org/10.14778/3749646.3749706},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,867 Nav-Index: A High-Performance, Adaptive Index for Shortest Path Queries in RDBMS 2026 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers