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.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 376 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00025097452 |
| 389 |
Query Processing in Spatial Network Databases |
2003 |
VLDB |
0.00024620268 |
| 433 |
Scalable Network Distance Browsing in Spatial Databases |
2008 |
SIGMOD |
0.00023310419 |
| 1,555 |
Efficient Route Planning on Public Transportation Networks: A Labelling Approach |
2015 |
SIGMOD |
0.00011395261 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 3,342 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.197276e-05 |
| 4,854 |
TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks |
2018 |
VLDB |
5.8743687e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 7,348 |
Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand |
2021 |
SIGMOD |
4.7554541e-05 |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
Semantically Similar Papers