Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks
Summary: TD-TNR-CH: a 4‑hop transit-node index for time‑dependent road networks that maps nodes to nearest transit (critical) nodes and precomputes candidate tables to answer medium/long TD‑MTTQs (short trips via TCH local search). Up to 103× faster queries and ~30 min parallel preprocessing. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Weihao Yu (Guangdong University of Technology)
- 2. Dian Ouyang (Guangdong University of Technology)
- 3. Fan Zhang (Guangdong University of Technology)
- 4. Xiang Zhao (National University of Defense Technology)
- 5. Shen Su (Guangdong University of Technology)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
- 7. Zhihong Tian (Guangdong University of Technology)
BibTeX Citation
@inproceedings{yu_sigmod26,
title = {{Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks}},
author = {Yu, Weihao and Ouyang, Dian and Zhang, Fan and Zhao, Xiang and Su, Shen and Lin, Xuemin and Tian, Zhihong},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769801},
url = {https://dl.acm.org/doi/10.1145/3769801},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 1,745 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB | 9.861709e-05 |
| 2,152 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD | 9.0778596e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 2 | 10,460 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 3 | 7,226 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 4 | 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 5 | 1,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD |
| 6 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 7 | 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD |
| 8 | 11,272 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB |
| 9 | 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD |
| 10 | 1,745 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB |