HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs
Summary: HR-Index encodes complete historical reachability for evolving graphs, letting historical queries be answered as static reachability on the index. Two optimizations shrink index size; experiments show order-of-magnitude speed/space gains vs. the state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yajun Yang
- 2. Hanxiao Li
- 3. Xiangju Zhu
- 4. Junhu Wang
- 5. Xin Wang
- 6. Hong Gao
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,547 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027081079 |
| 425 | Stack-based Algorithms for Pattern Matching on DAGs | 2005 | VLDB | 0.00023598882 |
| 788 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.00016650034 |
| 1,777 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.00010589591 |
| 1,880 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010226347 |
| 3,639 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 6.8913642e-05 |
| 3,671 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 6.8560247e-05 |
| 5,540 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB | 5.4498271e-05 |
Previous
Page 1 / 1
Next