Dynamic Graph Databases with Out-of-order Updates
Muhammad Ghufran Khan, Ioana Manolescu, Angelos-Christos G. Anadiotis
2024年份
5被引次数
摘要
Several real-time applications rely on dynamic graphs to model and store data arriving from multiple streams. Providing both high ingestion rate and efficient analytics with transactional guarantees is challenging, even more so when updates may be received out-of-order at the database. In this work, we propose HAL, a novel in-memory dynamic graph database design, addressing these challenges. HAL outperforms comparable systems by a factor of up to 73× in terms of update processing throughput and up to 357× for analytics, while being the first to support out-of-order updates.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper4
- Teseo and the Analysis of Structural Dynamic GraphsDean De Leo, Peter BonczVLDB 2021 · 被引用 65 次
- LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List ScansXiaowei Zhu, Marco Serafini, Xiaosong Ma, Ashraf Aboulnaga 等VLDB 2020 · 被引用 53 次
- Sortledton: a universal, transactional graph data structurePer Fuchs, Jana Giceva, Domagoj MarganVLDB 2022 · 被引用 46 次
- Spruce: a Fast yet Space-saving Structure for Dynamic Graph StorageJifan Shi, Biao Wang, Yun XuSIGMOD 2024 · 被引用 19 次
相关 Paper
- RapidStore: An Efficient Dynamic Graph Storage System for Concurrent QueriesChiyu Hao, Jixian Su, Shixuan Sun, Hao Zhang 等VLDB 2025 · 被引用 2 次
- Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected GraphsQing Chen, Oded Lachish, Sven Helmer, Michael H. BöhlenVLDB 2022 · 被引用 19 次
- Bridging the Gap between Relational OLTP and Graph-based OLAPSijie Shen, Zihang Yao, Lin Shi, Lei Wang 等USENIX ATC 2023
- Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAPTobias Schmidt, Dominik Durner, Viktor Leis, Thomas NeumannVLDB 2024 · 被引用 12 次
- BACH: Bridging Adjacency List and CSR Format using LSM-Trees for HGTAP WorkloadsJianfeng Huang, Cao Yihao, Ren Shubing, Baohua Wu 等VLDB 2025 · 被引用 3 次
