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 (People's Daily Online; Tianjin University)
- 2. Hanxiao Li (Tianjin University)
- 3. Xiangju Zhu (Tianjin University)
- 4. Junhu Wang (Griffith University)
- 5. Xin Wang (Tianjin University)
- 6. Hong Gao (Zhejiang Normal University)
BibTeX Citation
@inproceedings{yang_sigmod23,
title = {{HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs}},
author = {Yang, Yajun and Li, Hanxiao and Zhu, Xiangju and Wang, Junhu and Wang, Xin and Gao, Hong},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589272},
url = {https://dl.acm.org/doi/10.1145/3589272},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,812 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB | 5.3652966e-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 |
|---|---|---|---|---|
| 322 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00021275303 |
| 444 | Stack-based Algorithms for Pattern Matching on DAGs | 2005 | VLDB | 0.00018350865 |
| 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.00014402233 |
| 1,533 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010467148 |
| 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 9.7380494e-05 |
| 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 7.5712342e-05 |
| 3,594 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 7.2736453e-05 |
| 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB | 6.3883109e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 2 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |
| 3 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 4 | 5,393 | Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets | 2012 | VLDB |
| 5 | 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 6 | 2,575 | K-Reach: Who is in Your Small World | 2012 | VLDB |
| 7 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 8 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 9 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |