recently, a paper co-authored by our database systems research group in collaboration with the university of waterloo and the university of new south wales was accepted by the international academic conference vldb 2024. the first, second, and third authors of the paper are phd students jia-min hou, zhan-hao zhao, and master’s student zhou-yu wang, respectively. the supervising professors are xiao-yong du and wei lu. vldb is a class a international academic conference recommended by the china computer federation (ccf) and is one of the most prestigious conferences in the field of databases. the 2024 international conference on very large data bases will be held in guangzhou from august 25th to august 29th, 2024.
title: aeong: an efficient built-in temporal support in graph databases
authors: hou jiamin, zhao zhanhao, wang zhouyu, lu wei, jin guodong, dong wen, du xiaoyong
corresponding author: lu wei
abstract: graphs in the real world are often dynamic and evolve over time. storing the evolution of graphs and enabling temporal queries on them is crucial. however, existing approaches either incur high storage overhead or lack efficient temporal query support. to address these limitations, this paper proposes aeong, a graph database with built-in temporal support. this method extends the traditional property graph model by introducing temporal features, thereby defining a temporal graph model. based on this temporal graph model, we redesign both the storage engine and the query engine. the storage engine is divided into current storage and historical storage components. the current storage manages the latest versions of graph objects, while the historical storage manages previous versions of graph objects. this separation reduces the performance impact of querying the latest versions of graph objects. additionally, to minimize historical storage overhead, we propose an anchor delta strategy. this strategy periodically creates full versions (anchors) of graph objects and maintains each change (delta) between adjacent anchors of the same object. to improve temporal query processing efficiency, we introduce an anchor-based version retrieval technique in the query engine, which skips unnecessary traversal of historical versions. we conducted extensive experiments on real-world and synthetic datasets. results show that compared to state-of-the-art methods, aeong reduces storage consumption by up to 5.73 times and temporal query latency by 2.57 times, while only causing a 9.74% performance degradation for primary non-temporal queries.
hou jiamin is a ph.d. student in the school of information at renmin university of china, majoring in computer application technology. his advisors are professor du xiaoyong and professor lu wei, and his primary research focus is on graph database systems.
lu wei is a professor at renmin university of china and a ph.d. advisor. he is also a member of the database special committee of the china computer federation (ccf). in recent years, he has focused on research in the fields of database theory and distributed databases. he has published over 50 papers in renowned international conferences and journals, including sigmod, vldb, icde, atc, vldb journal, and tkde.
