Surrounding Join Query Processing in Spatial Databases

Spatial join queries play an important role in spatial database, and mostly all the distance-based join queries are based on the range search and nearest neighbour (NN), namely range join query and kNN join query. In this paper, we propose a new join query which is called surrounding join query. Given two point datasets Q and P of multidimensional objects, the surrounding query retrieves for each point in Q its all surrounding points in P. As a new spatial join query, we propose algorithms that are able to process such query efficiently. Evaluation on multiple real world datasets illustrate that our approach achieves high performance.