Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach
Summary: Adaptive fastest-path search mines historical traffic to identify frequently traveled, context-effective routes beyond Euclidean distance and fixed speeds. Road-hierarchy partitioning, selective precomputation, and data-supported edge pruning yield short, well-supported paths with substantially lower query cost. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hector Gonzalez (University of Illinois Urbana-Champaign)
- 2. Jiawei Han (University of Illinois Urbana-Champaign)
- 3. Xiaolei Li (University of Illinois Urbana-Champaign)
- 4. Margaret Myslinska (University of Illinois Urbana-Champaign)
- 5. John Paul Sondag (University of Illinois Urbana-Champaign)
BibTeX Citation
@article{gonzalez_vldb07,
title = {{Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach}},
author = {Gonzalez, Hector and Han, Jiawei and Li, Xiaolei and Myslinska, Margaret and Sondag, John Paul},
journal = {PVLDB},
series = {{VLDB} '07},
volume = {30},
number = {2},
pages = {794--805},
doi = {10.14778/1325851.1325944},
url = {https://doi.org/10.14778/1325851.1325944},
year = {2007}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,381 | Finding Time Period-Based Most Frequent Path in Big Trajectory Data | 2013 | SIGMOD | 0.00010965263 |
| 3,849 | Calibrating Trajectory Data for Similarity-based Analysis | 2013 | SIGMOD | 7.0745507e-05 |
| 4,541 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB | 6.6397712e-05 |
| 11,695 | Towards Crowd-aware Indoor Path Planning | 2021 | VLDB | 5.093636e-05 |
| 12,126 | CANDS: Continuous Optimal Navigation via Distributed Stream Processing | 2015 | 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 |
|---|---|---|---|---|
| 1,994 | RainForest - A Framework for Fast Decision Tree Construction of Large Datasets | 1998 | VLDB | 9.3409624e-05 |
| 6,800 | FlowCube: Constructing RFID FlowCubes for Multi-Dimensional Analysis of Commodity Flows | 2006 | VLDB | 5.7700096e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,111 | Efficient Algorithms for Finding Optimal Meeting Point on Road Networks | 2011 | VLDB |
| 2 | 2,097 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB |
| 3 | 2,153 | Monitoring Path Nearest Neighbor in Road Networks | 2009 | SIGMOD |
| 4 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 5 | 11,442 | Effective and Efficient Route Planning Using Historical Trajectories on Road Networks | 2023 | VLDB |
| 6 | 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |
| 7 | 10,918 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB |
| 8 | 5,112 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB |
| 9 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 10 | 9,229 | Continuously Monitoring Alternative Shortest Paths on Road Networks | 2020 | VLDB |