High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying
International Journal of Intelligent Systems and Data Science · 22.08.2026 · 1 (4)
DOI: 10.67231/70s0kt73 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Intelligent Systems and Data Science, online erschienen am 22.08.2026. Verfasst von Elvis Mondal. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper presents a novel framework for managing persistent graph data, focusing on achieving favorable performance characteristics. It describes a system designed with a special key-mapped trie as the primary data structure. The innovation is in the design of adaptive copying and chunking to greatly reduce memory overhead and enhance the speed of different graph operations. This paper explores the architectural benefits of such persistent designs and demonstrates their efficiency and scalability on complex graph management problems that require maintaining multiple historical versions. According to the experimental results, our approach achieves a substantial reduction in memory usage over traditional persistent graph structures, while also exhibiting competitive operation performance across a wide range of workloads.
Zitieren
APA
Mondal, E. (2026). High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying. International Journal of Intelligent Systems and Data Science, 1(4). https://doi.org/10.67231/70s0kt73
Vancouver
Mondal E. High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying. International Journal of Intelligent Systems and Data Science. 2026;1(4). doi:10.67231/70s0kt73
BibTeX
@article{Mondal2026,
author = {Mondal, Elvis},
title = {High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying},
journal = {International Journal of Intelligent Systems and Data Science},
year = {2026},
volume = {1},
number = {4},
doi = {10.67231/70s0kt73}
}
EUVIMED