Banyan: A Scoped Dataflow Engine for Graph Query Service
Li Su, Xiaoming Qin, Zichao Zhang, Rui Yang, Le Xu, Indranil Gupta, Wenyuan Yu, Kai Zeng, Jingren Zhou
Abstract
Graph query services (GQS) are widely used today to interactively answer graph traversal queries on large-scale graph data. Existing graph query engines focus largely on optimizing the latency of a single query. This ignores significant challenges posed by GQS, including fine-grained control and scheduling during query execution, as well as performance isolation and load balancing in various levels from across user to intra-query. To tackle these control and scheduling challenges, we propose a novel scoped dataflow for modeling graph traversal queries, which explicitly exposes concurrent execution and control of any subquery to the finest granularity. We implemented Banyan, an engine based on the scoped dataflow model for GQS. Banyan focuses on scaling up the performance on a single machine, and provides the ability to easily scale out. Extensive experiments on multiple benchmarks show that Banyan improves performance by up to three orders of magnitude over state-of-the-art graph query engines, while providing performance isolation and load balancing.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext beaf7a1b-37f1-4618-acec-e16d5d7dd5f6Cited by top-tier papers5
- Aster: Enhancing LSM-structures for Scalable Graph DatabaseDingheng Mo, Junfeng Liu, Fan Wang, Siqiang LuoSIGMOD 2025 · 10 citations
- VertexSurge: Variable Length Graph Pattern Match on Billion-edge GraphsWeiyu Xie, Mingxing Zhang, Xia Liao, Kang Chen et al.ASPLOS 2024 · 1 citation
- Distributed Evaluation of Graph Queries Using Recursive Relational AlgebraSarah Chlyah, Pierre Genevès, Nabil LayaïdaICDE 2025
- Aquila: A High-Concurrency System for Incremental Graph QueryZiqi Zou, Hao Zhang, Jiaxin Yao, Kangfei Zhao et al.VLDB 2026
- Scaling Asynchronous Graph Query Processing via Partitioned Stateful Traversal MachinesShaoyuan Chen, Hongtao Chen, Shaonan Ma, Yajie Qin et al.ICDE 2025
Builds on2
Related papers
- iQAN: Fast and Accurate Vector Search with Efficient Intra-Query Parallelism on Multi-Core ArchitecturesZhen Peng, Minjia Zhang, Kai Li, Ruoming Jin et al.PPoPP 2023 · 20 citations
- MiniGraph: Querying Big Graphs with a Single MachineXiaoke Zhu, Yang Liu, Shuhao Liu, Wenfei FanVLDB 2023 · 12 citations
- HUGE: An Efficient and Scalable Subgraph Enumeration SystemZhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao et al.SIGMOD 2021 · 57 citations
- An Efficient Memoization Engine for Concurrent Graph Query ProcessingSen Gao, Shengliang Lu, Shixuan Sun, Yuchen Li et al.ICDE 2025 · 1 citation
- Graphix: "One User's JSON is Another User's Graph"Glenn Galvizo, Michael J. CareyICDE 2024 · 1 citation
