Research for the nearest neighbor query based on RBRT tree

The nearest neighbor query of spatial dataset is an important issue in spatial data query area. In order to overcome the disadvantages of existing spatial index structure in data organization and querying, the new nearest neighbor query methods and pruning rules were proposed based on R^BRT tree. The NN RT search algorithm was given. The NN_RT search approach calculated and pruned nodes of each level from top to bottom. A large number of data points were filtered in advance. Furthermore, in allusion to the data information of the trapezoidal spatial object and trapezoidal distribution, the methods of querying nearest neighbor in the restricted area based on R^BRT tree were studied, The NN_FRTsearch algorithm and NN_LRTsearch algorithm were proposed. Theory and experiments show the algorithms which proposed have certain advantages on the aspect of query efficiency.