High-Throughput k Nearest Neighbors Search in Road Networks
Summary: Local subgraph-based kNN indexing for road networks under frequent inserts/deletes, targeting throughput rather than just latency. Updates touch only affected subgraphs; queries incrementally explore boundary vertices with a correctness proof that local info suffices for global kNN. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yu Kong (University of Sydney)
- 2. Lijun Chang (University of Sydney)
- 3. Dong Wen (University of New South Wales)
- 4. Dian Ouyang (Guangdong University of Technology)
BibTeX Citation
@inproceedings{kong_sigmod26,
title = {{High-Throughput k Nearest Neighbors Search in Road Networks}},
author = {Kong, Yu and Chang, Lijun and Wen, Dong and Ouyang, Dian},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786656},
url = {https://dl.acm.org/doi/10.1145/3786656},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 449 | Query Processing in Spatial Network Databases | 2003 | VLDB | 0.0001826404 |
| 665 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB | 0.00015167291 |
| 1,025 | An Efficient and Scalable Approach to CNN Queries in a Road Network | 2005 | VLDB | 0.00012578515 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 1,620 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB | 0.00010206305 |
| 4,573 | TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks | 2018 | VLDB | 6.6226156e-05 |
| 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD | 6.0183678e-05 |
| 6,292 | Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks | 2023 | SIGMOD | 5.9251728e-05 |
| 8,731 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 5.3766157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD |
| 2 | 9,143 | Processing Proximity Relations in Road Networks | 2010 | SIGMOD |
| 3 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 4 | 1,620 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB |
| 5 | 2,629 | Distance Indexing on Road Networks | 2006 | VLDB |
| 6 | 665 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB |
| 7 | 5,851 | k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation | 2016 | VLDB |
| 8 | 11,272 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB |
| 9 | 8,731 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB |
| 10 | 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |