The Partition Bridge (PB) tree: Efficient nearest neighbor query processing on road networks

Xiangqiang Min, Dieter Pfoser, Andreas Züfle, Yehua Sheng, Yi Huang

Abstract: Highlights•The PB-tree with an adaptive and efficient tree indexing, which has low space overhead and better performance, is developed.•The index is based on road network partitioning considering the spatial objects (SOs) distribution in combination with the network topology.•An efficient query algorithm that combines “top-down” and “bottom-up” and adjacent extension methods is devised.