Catching up with Disorder: Dynamic Graphs with Out-of-Order Updates
Several real-time applications rely on dynamic graphs to model and store data arriving from multiple streams, potentially distributed. Providing both high ingestion rate and efficient analytics with transactional guarantees over such dynamic graphs is challenging, even more so when updates may be received out-of-order at the database. We propose to demonstrate HAL [2], a novel in-memory dynamic graph database system, which addresses 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.
Authors
- Muhammad Ghufran Khan (ORCID: https://orcid.org/0000-0001-9063-6464)
- Ioana Manolescu (ORCID: https://orcid.org/0000-0002-0425-2462)
- Angelos-Christos G. Anadiotis (ORCID: https://orcid.org/0000-0001-8101-6044)
Institutions
- Institut national de recherche en sciences et technologies du numérique (FR)
Publication Details
- Published
- 2025-06-17
- DOI
- https://doi.org/10.1145/3722212.3725085
- Primary Topic
- Data Management and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00