TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks
Summary: TOAIN: adaptive index for dynamic kNN on road networks targeting throughput. It models throughput as a function of system factors (update time, arrival rates) and is trainable to adapt to environments, outperforming prior solutions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Siqiang Luo (University of Hong Kong)
- 2. Ben Kao (University of Hong Kong)
- 3. Guoliang Li (Tsinghua University)
- 4. Jiafeng Hu (University of Hong Kong)
- 5. Reynold Cheng (University of Hong Kong)
- 6. Yudian Zheng (Twitter)
BibTeX Citation
@article{luo_vldb18,
title = {{TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks}},
author = {Luo, Siqiang and Kao, Ben and Li, Guoliang and Hu, Jiafeng and Cheng, Reynold and Zheng, Yudian},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {5},
pages = {594--606},
doi = {10.1145/3177732.3177736},
url = {https://doi.org/10.1145/3177732.3177736},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,107 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD | 5.8852347e-05 |
| 8,895 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 5.2559789e-05 |
| 9,130 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 5.2233025e-05 |
| 9,181 | Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space | 2024 | SIGMOD | 5.2118872e-05 |
| 10,647 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD | 4.9793485e-05 |
| 10,652 | Improving Range Scan Performance in LSM-trees with Group Caching | 2026 | SIGMOD | 4.9793485e-05 |
| 11,600 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 447 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00018159715 |
| 458 | Query Processing in Spatial Network Databases | 2003 | VLDB | 0.00017868943 |
| 677 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB | 0.00014843441 |
| 1,048 | An Efficient and Scalable Approach to CNN Queries in a Road Network | 2005 | VLDB | 0.00012303367 |
| 1,232 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.0001141008 |
| 1,652 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB | 9.9778734e-05 |
| 2,602 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 8.2325477e-05 |
| 5,966 | k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation | 2016 | VLDB | 5.9325005e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,705 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB |
| 2 | 1,652 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB |
| 3 | 11,752 | TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks | 2023 | VLDB |
| 4 | 4,906 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 5 | 10,576 | Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks | 2026 | SIGMOD |
| 6 | 5,966 | k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation | 2016 | VLDB |
| 7 | 11,600 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB |
| 8 | 8,895 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB |
| 9 | 6,107 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 10 | 10,647 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |