Reachability Queries on Large Dynamic Graphs: A Total Order Approach
Summary: Total-order reachability indexing for large dynamic graphs, unifying static indices under a single framework. Efficient updates for insertions/deletions, scalable index construction, and experiments show faster queries and updates than static baselines on graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Andy Diwen Zhu (Nanyang Technological University)
- 2. Wenqing Lin (Nanyang Technological University)
- 3. Sibo Wang (Nanyang Technological University)
- 4. Xiaokui Xiao (Nanyang Technological University)
BibTeX Citation
@inproceedings{zhu_sigmod14,
title = {{Reachability Queries on Large Dynamic Graphs: A Total Order Approach}},
author = {Zhu, Andy Diwen and Lin, Wenqing and Wang, Sibo and Xiao, Xiaokui},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2612181},
url = {https://dl.acm.org/doi/10.1145/2588555.2612181},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,606 | K-Reach: Who is in Your Small World | 2012 | VLDB |
| 2 | 5,531 | Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets | 2012 | VLDB |
| 3 | 7,844 | DAG Reduction: Fast Answering Reachability Queries | 2017 | SIGMOD |
| 4 | 4,550 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 5 | 4,050 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 6 | 9,312 | HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs | 2023 | SIGMOD |
| 7 | 2,535 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 8 | 9,812 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 9 | 776 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 10 | 6,770 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |