Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
Summary: Proposes Edge-Disjoint Partitioning (EDP) for Edge-Constrained Shortest Path (ECSP) on dynamic, labeled graphs, with a label-driven index and a traversal that exploits ECSP answer regularities. On-demand sub-paths per partition are cached and stitched across partitions; updates invalidate affected entries, delivering up to 10^4× faster ECSP queries on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mohamed S. Hassan (Purdue University)
- 2. Walid G. Aref (Purdue University)
- 3. Ahmed M. Aly (Purdue University)
BibTeX Citation
@inproceedings{hassan_sigmod16,
title = {{Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs}},
author = {Hassan, Mohamed S. and Aref, Walid G. and Aly, Ahmed M.},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2882933},
url = {https://dl.acm.org/doi/10.1145/2882903.2882933},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,150 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB | 8.9509559e-05 |
| 3,488 | LEGO-GraphRAG: Modularizing Graph-based Retrieval-Augmented Generation for Design Space Exploration | 2025 | VLDB | 7.2425679e-05 |
| 6,192 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 5.8377174e-05 |
| 7,399 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB | 5.5186598e-05 |
| 8,085 | Correlation Constraint Shortest Path over Large Multi-Relation Graphs | 2019 | VLDB | 5.3751128e-05 |
| 10,044 | PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks | 2024 | VLDB | 5.0786422e-05 |
| 10,884 | X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs | 2026 | VLDB | 4.9605343e-05 |
| 11,272 | Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks | 2025 | SIGMOD | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 449 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00018112854 |
| 1,270 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB | 0.00011232621 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 779 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 2 | 1,859 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 3 | 376 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD |
| 4 | 5,409 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 5 | 11,634 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 6 | 1,270 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 7 | 3,582 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 8 | 7,399 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 9 | 6,786 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 356 | On Graph Query Optimization in Large Networks | 2010 | VLDB |