INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS AND DATA SCIENCE

High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying

1.DePaul University

Published in issue

October 2026

Volume / Issue

Vol. 1 No. 4

Access

Open access

View PDF

The article details presented on this page reflect the published version of record. Readers may access the full-text PDF, review the citation information, and export the reference in supported citation formats.

Abstract

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.
Keywords:Persistent Data StructuresTrie Data StructuresAdaptive AlgorithmsMemory OptimizationGraph Databases

Cite this Article

Use the following citation when referencing this publication in academic or professional work.

E. Mondal, "High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying", Int. J. Intell. Syst. Data Sci., vol. 1, no. 4, Oct. 2026, doi: https://doi.org/10.67231/70s0kt73.

DOWNLOAD CITATION

High-Throughput Graph Structures: Trie-Based Persistence with Adaptive Copying | International Journal of Intelligent Systems and Data Science