On Compressing Historical Cliques in Temporal Graphs
- Publisher:
- Springer
- Publication Type:
- Conference Proceeding
- Citation:
- Database Systems for Advanced Applications, 2024, 14850 LNCS, pp. 37-53
- Issue Date:
- 2024-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 978-981-97-5552-3_3.pdf | Published version | 555.17 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Maximal clique is a fundamental cohesive subgraph model that plays an important role in many practical applications such as social network analysis and bioinformatics. Many real-world graphs change over time, with edges arriving continuously, and each edge has a timestamp representing the arrival time of that edge; such graphs are also known as temporal graphs. All maximal cliques in all snapshots since all possible historical moments are called historical cliques. Querying historical cliques has not been explored in existing research efforts. In this paper, we study the problem of compressing historical cliques in temporal graphs. We design a novel trie index structure called HC-Trie to compress historical cliques by exploiting the duration of historical cliques and the overlapping relationship between different historical cliques. We also propose an algorithm for maintaining the index when the graph changes. Experiments on real-world temporal graphs demonstrate that our solution achieves much faster query efficiency than the online solution and significantly less index space than the straightforward solution.
Please use this identifier to cite or link to this item: