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
- 11822
- Venue
- VLDB
- Year
- 2019
- Pagerank
- 0.00010175836
- Overall Rank
- 1,893 | 86.85%
- 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.5600506e-05 |
| 3,346 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.1903469e-05 |
| 4,091 |
RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s |
2021 |
SIGMOD |
6.4529617e-05 |
| 5,255 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.5991117e-05 |
| 6,420 |
A Deep Generative Model for Trajectory Modeling and Utilization |
2023 |
VLDB |
5.0621949e-05 |
| 6,491 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0368875e-05 |
| 8,016 |
Nuhuo: An Effective Estimation Model for Traffic Speed Histogram Imputation on A Road Network |
2024 |
VLDB |
4.6014683e-05 |
| 8,236 |
Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties |
2022 |
SIGMOD |
4.5475127e-05 |
| 8,287 |
QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.5392079e-05 |
| 9,679 |
Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks |
2024 |
VLDB |
4.3006524e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,135 |
ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,408 |
Bursting Flow Query on Large Temporal Flow Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 11,049 |
Efficient Stochastic Routing in Path-Centric Uncertain Road Networks |
2024 |
VLDB |
4.1905499e-05 |
| 11,501 |
Towards Crowd-aware Indoor Path Planning |
2021 |
VLDB |
4.1905499e-05 |
| 11,516 |
A Demonstration of QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.1905499e-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,472 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3300131e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1905499e-05 |
| 4,620 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0368524e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 1,694 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010870205 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1905499e-05 |