Database Paper Browser

Back to papers

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)

Paper ID
7482
Venue
SIGMOD
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,171 | 29.25%
DOI
10.1145/3786656

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers