{"ID":2822840,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2601.01444","arxiv_id":"2601.01444","title":"RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage (Extended Version)","abstract":"Dynamic graphs model many real-world applications, and as their sizes grow, efficiently storing and updating them becomes critical. We present RadixGraph, a fast and memory-efficient data structure for dynamic graph storage. RadixGraph features a carefully designed radix-tree-based vertex index that strikes an optimal trade-off between query efficiency and space among all pointer-array-based radix trees. For edge storage, it employs a hybrid snapshot-log architecture that enables amortized $O(1)$ update time. RadixGraph supports millions of concurrent updates per second while maintaining competitive performance for graph analytics. Experimental results show that RadixGraph outperforms the most performant baseline by up to $16.27\\times$ across various datasets in ingesting graph updates, and reduces memory usage by an average of $40.1\\%$. RadixGraph is open-source at https://github.com/ForwardStar/RadixGraph.","short_abstract":"Dynamic graphs model many real-world applications, and as their sizes grow, efficiently storing and updating them becomes critical. We present RadixGraph, a fast and memory-efficient data structure for dynamic graph storage. RadixGraph features a carefully designed radix-tree-based vertex index that strikes an optimal...","url_abs":"https://arxiv.org/abs/2601.01444","url_pdf":"https://arxiv.org/pdf/2601.01444v2","authors":"[\"Haoxuan Xie\",\"Junfeng Liu\",\"Siqiang Luo\",\"Kai Wang\"]","published":"2026-01-04T09:14:00Z","proceeding":"cs.DB","tasks":"[\"cs.DB\"]","methods":"[]","has_code":false,"code_links":[{"ID":605453,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_id":2822840,"paper_url":"https://arxiv.org/abs/2601.01444","paper_title":"RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage (Extended Version)","repo_url":"https://github.com/ForwardStar/RadixGraph","is_official":false,"mentioned_in_paper":false,"mentioned_in_github":true,"github_stars":0}]}