We also extend BANNS to process All-k-Nearest-Neighbor queries which means given two sets of spatial objects A, B, find each object in A its k nearest neighbors in B.

• 综上，我们研究了道路网络中的多对象最近邻查询问题，提出一个新颖的查询处理算法BANNS，并对其进行了扩展。