Papers › A Review of In-Memory Space-Efficient Data Structures for Temporal Graphs
A Review of In-Memory Space-Efficient Data Structures for Temporal Graphs
Luiz F. A. Brito, Bruno A. N. Travençolo, Marcelo K. Albertini
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Temporal graphs model relationships among entities over time. Recent studies applied temporal graphs to abstract complex systems such as continuous communication among participants of social networks. Often, the amount of data is larger than main memory, therefore, we need specialized structures that balance space usage and query efficiency. In this paper, we review space-efficient data structures that bring large temporal graphs from external memory to primary memory and speed up specialized queries. We found a great variety of studies using data compression techniques and self-indexed compressed data structures. We point further research directions to improve the current state-of-the-art.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections