k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation
Summary: In-memory evaluation of kNN on road networks, comparing network distance with Euclidean proxies and reproducing state-of-the-art methods fairly. Revisits the discarded IER approach with a simple improvement, often achieving the best performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tenindra Abeywickrama (Monash University)
- 2. Muhammad Aamir Cheema (Monash University)
- 3. David Taniar (Monash University)
BibTeX Citation
@article{abeywickrama_vldb16,
title = {{k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation}},
author = {Abeywickrama, Tenindra and Cheema, Muhammad Aamir and Taniar, David},
journal = {PVLDB},
series = {{VLDB} '16},
volume = {9},
number = {6},
pages = {492--503},
doi = {10.14778/2850583.2850592},
url = {https://doi.org/10.14778/2850583.2850592},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,688 | TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks | 2018 | VLDB | 6.4517069e-05 |
| 8,655 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD | 5.2794257e-05 |
| 9,434 | Adaptive Indexing in High-Dimensional Metric Spaces | 2023 | VLDB | 5.1649835e-05 |
| 9,442 | Continuously Monitoring Alternative Shortest Paths on Road Networks | 2020 | VLDB | 5.1632484e-05 |
| 10,282 | VIP-Tree: An Effective Index for Indoor Spatial Queries | 2017 | VLDB | 5.0334833e-05 |
| 11,606 | LION: Fast and High-Resolution Network Kernel Density Visualization | 2024 | VLDB | 4.9605343e-05 |
| 12,199 | Top-k Queries over Digital Traces | 2019 | SIGMOD | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00018112854 |
| 463 | Query Processing in Spatial Network Databases | 2003 | VLDB | 0.00017806376 |
| 681 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB | 0.00014792999 |
| 954 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00012856563 |
| 1,053 | An Efficient and Scalable Approach to CNN Queries in a Road Network | 2005 | VLDB | 0.00012260546 |
| 2,689 | Distance Indexing on Road Networks | 2006 | VLDB | 8.1137602e-05 |
| 6,819 | Spatial Joins in Main Memory: Implementation Matters! | 2015 | VLDB | 5.658433e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,689 | Distance Indexing on Road Networks | 2006 | VLDB |
| 2 | 449 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD |
| 3 | 954 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |
| 4 | 11,653 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB |
| 5 | 681 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB |
| 6 | 2,206 | Monitoring Path Nearest Neighbor in Road Networks | 2009 | SIGMOD |
| 7 | 10,719 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 8 | 6,073 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 9 | 1,660 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB |
| 10 | 8,923 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB |