Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks
Summary: Architecture-Intact oracle for dynamic spatial networks using randomization. Delivers fast distance and shortest-path queries with negligible updates; preprocessing/space O(n log^2 n), distance query O(log^4 n log log n) and path O(log^4 n log log n + l); updates O(log^3 n) w.h.p. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,236 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB | 4.7932355e-05 |
| 7,444 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB | 4.7281454e-05 |
| 9,470 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD | 4.3341665e-05 |
| 10,938 | Proximity Queries on Point Clouds using Rapid Construction Path Oracle | 2024 | SIGMOD | 4.1945683e-05 |
| 5,597 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB | 5.4178241e-05 |
| 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00023310419 |
| 11,789 | Distance Oracle on Terrain Surface | 2017 | SIGMOD | 4.1945683e-05 |
| 1,690 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00010904736 |
| 1,170 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00013511856 |
| 945 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00015137526 |