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.
@article{arxiv.2204.12468,
title = {A Review of In-Memory Space-Efficient Data Structures for Temporal Graphs},
author = {Luiz F. A. Brito and Bruno A. N. Travençolo and Marcelo K. Albertini},
journal= {arXiv preprint arXiv:2204.12468},
year = {2022}
}