A new DR-tree K-nearest neighbor query algorithm based on direction relationship

The K-nearest neighbor query algorithm based on R-tree is an important class of search algorithm in geographic information system, a new DR-tree index is proposed based on the direction relationship, it can fast achieve to carry on K-nearest neighbor query, the experiments show that conducting the K-nearest neighbor query algorithm by using of the new DR-tree can greatly reduce the CPU time, improve the query efficiency, so it has a very good use value in practice.