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 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,097 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB | 9.1725037e-05 |
| 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 5.824568e-05 |
| 7,226 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB | 5.6667372e-05 |
| 7,976 | Correlation Constraint Shortest Path over Large Multi-Relation Graphs | 2019 | VLDB | 5.5152959e-05 |
| 9,815 | PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks | 2024 | VLDB | 5.214913e-05 |
| 10,789 | Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks | 2025 | SIGMOD | 5.093636e-05 |
| 10,916 | LEGO-GraphRAG: Modularizing Graph-based Retrieval-Augmented Generation for Design Space Exploration | 2025 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00018532516 |
| 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB | 0.00011484136 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 2 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 3 | 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD |
| 4 | 5,678 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 5 | 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 6 | 3,522 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 7 | 7,226 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 8 | 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 9 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB |