DBScholar

Back to papers

AeonG: An Efficient Built-in Temporal Support in Graph Databases

Summary: AeonG adds built-in temporal graph support with a hybrid storage—current store for latest versions and a historical store using periodic full anchors plus deltas to compress history. Anchor-based version retrieval avoids needless traversals, yielding up to 5.73× less storage and 2.57× faster temporal queries versus prior work with ~9.7% runtime overhead. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13582
Venue
VLDB
Year
2024
Pagerank
5.5196714e-05
Overall Rank
7,897 | 45.83%
DOI
10.14778/3648160.3648187

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{hou_vldb24,
        title = {{AeonG: An Efficient Built-in Temporal Support in Graph Databases}},
        author = {Hou, Jiamin and Zhao, Zhanhao and Wang, Zhouyu and Lu, Wei and Jin, Guodong and Wen, Dong and Du, Xiaoyong},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {6},
        pages = {1515--1527},
        doi = {10.14778/3648160.3648187},
        url = {https://doi.org/10.14778/3648160.3648187},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,896 Aster: Enhancing LSM-structures for Scalable Graph Database 2025 SIGMOD 5.3495662e-05
10,600 Chipmink: Efficient Delta Identification for Massive Object Graphs 2026 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers