On Querying Historical Evolving Graph Sequences
Summary: Introduces historical evolving graph sequences (EGS) and the FVF framework for efficient EGS query processing. Leverages cross-graph redundancy to compress and speed analytics on EGS; experiments on real and synthetic data show strong performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chenghui Ren (University of Hong Kong)
- 2. Eric Lo (Hong Kong Polytechnic University)
- 3. Ben Kao (University of Hong Kong)
- 4. Xinjie Zhu (University of Hong Kong)
- 5. Reynold Cheng (University of Hong Kong)
BibTeX Citation
@article{ren_vldb11,
title = {{On Querying Historical Evolving Graph Sequences}},
author = {Ren, Chenghui and Lo, Eric and Kao, Ben and Zhu, Xinjie and Cheng, Reynold},
journal = {PVLDB},
series = {{VLDB} '11},
volume = {4},
number = {11},
pages = {726--737},
doi = {10.14778/3402707.3402713},
url = {https://doi.org/10.14778/3402707.3402713},
year = {2011}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,312 | On Querying Historical K-Cores | 2021 | VLDB | 7.5309892e-05 |
| 9,132 | HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs | 2023 | SIGMOD | 5.31719e-05 |
| 9,207 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB | 5.3058708e-05 |
| 9,884 | Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing | 2020 | SIGMOD | 5.2028745e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,671 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 187 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00026138589 |
| 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022786599 |
| 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00020375193 |
| 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019937972 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 2 | 4,503 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 3 | 687 | Sequence Query Processing | 1994 | SIGMOD |
| 4 | 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD |
| 5 | 8,691 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS |
| 6 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 7 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 8 | 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD |
| 9 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |
| 10 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |