Back to papers
Querying Shortest Paths on Time Dependent Road Networks
Summary: Proposes TD-G-tree, a height-balanced index for time-dependent road networks. Indexing only border TDSPs with hierarchical partitions enables fast TDSP queries and time-interval routing via DP and chronological divide-and-conquer; real-data experiments show gains.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11821
- Venue
- VLDB
- Year
- 2019
- Pagerank
- 0.00010185573
- Overall Rank
- 1,892 | 86.84%
- DOI
-
10.14778/3342263.3342265
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 3,342 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.197276e-05 |
| 4,096 |
RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s |
2021 |
SIGMOD |
6.4555664e-05 |
| 5,250 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.6044961e-05 |
| 6,425 |
A Deep Generative Model for Trajectory Modeling and Utilization |
2023 |
VLDB |
5.0670573e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 8,013 |
Nuhuo: An Effective Estimation Model for Traffic Speed Histogram Imputation on A Road Network |
2024 |
VLDB |
4.6058845e-05 |
| 8,242 |
Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties |
2022 |
SIGMOD |
4.551877e-05 |
| 8,294 |
QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.5435639e-05 |
| 9,679 |
Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,135 |
ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,397 |
Bursting Flow Query on Large Temporal Flow Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,046 |
Efficient Stochastic Routing in Path-Centric Uncertain Road Networks |
2024 |
VLDB |
4.1945683e-05 |
| 11,497 |
Towards Crowd-aware Indoor Path Planning |
2021 |
VLDB |
4.1945683e-05 |
| 11,512 |
A Demonstration of QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1945683e-05 |
| 4,621 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0426586e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 1,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |