Database Paper Browser

Back to papers

Efficient kNN Search in Public Transportation Networks

Summary: Lightweight, non-path-indexed structure for kNN on public-transportation graphs that attains near-optimal query time and scalable index construction. Empirically outperforms prior methods by up to 10^4× in query latency and 10^2× in index build time. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13551
Venue
VLDB
Year
2024
Pagerank
4.1945683e-05
Overall Rank
11,065 | 23.03%
DOI
10.14778/3681954.3682009

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 11 of 11 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