DBScholar

Back to papers

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)

Paper ID
6023
Venue
SIGMOD
Year
2020
Pagerank
6.0183678e-05
Overall Rank
5,987 | 58.93%
DOI
10.1145/3318464.3389746

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers