Affiliation:
1. Renmin University of China
2. University of Waterloo
3. UNSW, Australia
Abstract
Real-world graphs are often dynamic and evolve over time. It is crucial for storing and querying a graph's evolution in graph databases. However, existing works either suffer from high storage overhead or lack efficient temporal query support, or both. In this paper, we propose AeonG, a new graph database with built-in temporal support. AeonG is based on a novel temporal graph model. To fit this model, we design a storage engine and a query engine. Our storage engine is hybrid, with one current storage to manage the most recent versions of graph objects, and another historical storage to manage the previous versions of graph objects. This separation makes the performance degradation of querying the most recent graph object versions as slight as possible. To reduce the historical storage overhead, we propose a novel
anchor+delta
strategy, in which we periodically create a complete version (namely anchor) of a graph object, and maintain every change (namely delta) between two adjacent anchors of the same object. To boost temporal query processing, we propose an anchor-based version retrieval technique in the query engine to skip unnecessary historical version traversals. Extensive experiments are conducted on both real and synthetic datasets. The results show that AeonG achieves up to 5.73× lower storage consumption and 2.57× lower temporal query latency against state-of-the-art approaches, while introducing only 9.74% performance degradation for supporting temporal features.
Publisher
Association for Computing Machinery (ACM)
Reference49 articles.
1. Neo4j "https://neo4j.com." Accessed on 2024-02.
2. ArangoDB "https://www.arangodb.com." Accessed on 2024-02.
3. Dgraph "https://dgraph.io." Accessed on 2024-02.
4. Memgraph "https://memgraph.com." Accessed on 2024-02.
5. Fraud detection system: A survey