DocumentCode
1988311
Title
A new DR-tree K-nearest neighbor query algorithm based on direction relationship
Author
Li, Guobin ; Tang, Jine
Author_Institution
Sch. of Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China
Volume
2
fYear
2010
fDate
17-18 July 2010
Firstpage
246
Lastpage
250
Abstract
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.
Keywords
geographic information systems; pattern classification; query processing; trees (mathematics); unsupervised learning; DR-tree K-nearest neighbor query algorithm; R-tree; direction relationship; geographic information system; search algorithm; Decision support systems; K-nearest neighbor query algorithm; R-tree; direction relationship;
fLanguage
English
Publisher
ieee
Conference_Titel
Environmental Science and Information Application Technology (ESIAT), 2010 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-7387-8
Type
conf
DOI
10.1109/ESIAT.2010.5567337
Filename
5567337
Link To Document