Progressive Top-K Nearest Neighbors Search in Large Road Networks
Summary: Parameter-free, tree-decomposition index for kNN in road networks enables progressive, bounded-delay retrieval. Optimized index construction/maintenance scales to large networks, validated on real-world data from ten regions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dian Ouyang (University of Sydney)
- 2. Dong Wen (University of Technology Sydney)
- 3. Lu Qin (University of Technology Sydney)
- 4. Lijun Chang (University of Sydney)
- 5. Ying Zhang (University of Technology Sydney)
- 6. Xuemin Lin (University of New South Wales)
BibTeX Citation
@inproceedings{ouyang_sigmod20,
title = {{Progressive Top-K Nearest Neighbors Search in Large Road Networks}},
author = {Ouyang, Dian and Wen, Dong and Qin, Lu and Chang, Lijun and Zhang, Ying and Lin, Xuemin},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3389746},
url = {https://dl.acm.org/doi/10.1145/3318464.3389746},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019937972 |
| 1,201 | SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases | 2004 | SIGMOD | 0.00011674339 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 2,020 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB | 9.2983514e-05 |
| 4,573 | TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks | 2018 | VLDB | 6.6226156e-05 |
| 6,488 | Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads | 2012 | SIGMOD | 5.865078e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,153 | Monitoring Path Nearest Neighbor in Road Networks | 2009 | SIGMOD |
| 2 | 2,629 | Distance Indexing on Road Networks | 2006 | VLDB |
| 3 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 4 | 665 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB |
| 5 | 1,620 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB |
| 6 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | 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 | 10,460 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 10 | 8,731 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB |