DocumentCode :
3376202
Title :
An Index Structure for Efficient k-NN Query Processing in Location Based Services
Author :
Park, Yonghun ; Park, Hyoungsoon ; Seo, Dongmin ; Yoo, Jaesoo
Author_Institution :
Dept. Inf. & Commun. Eng., Chungbuk Nat. Univ., Cheongju, South Korea
fYear :
2009
fDate :
20-22 Dec. 2009
Firstpage :
1
Lastpage :
6
Abstract :
Many studies on index structures for k-NN query processing have been done in location based services(LBS). However, they are not suitable for the moving objects because their update costs are so expensive due to the frequent location updates of the moving objects. In this paper, we propose incremental search R-tree (ISR-tree) that processes k-NN queries efficiently in the environment with static objects and moving clients. In ISR-tree, the leaf-nodes maintain the entries pointing to their relevant neighbor nodes and the entries help to find the neighbor leaf-nodes without visiting internal nodes when k-NN queries are processed. We prove the superiority of ISR-tree through the comparison with previous works. As a result, since ISR-tree saves the costs to visit internal nodes, it significantly improves the performance over the existing index structure.
Keywords :
query processing; incremental search R-tree; index structure; k-NN query processing; location based services; neighbor leaf-nodes; Computer science; Costs; Data structures; Global Positioning System; Production; Query processing; Smart phones;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Ubiquitous Information Technologies & Applications, 2009. ICUT '09. Proceedings of the 4th International Conference on
Conference_Location :
Fukuoka
ISSN :
1976-0035
Print_ISBN :
978-1-4244-5131-9
Type :
conf
DOI :
10.1109/ICUT.2009.5405694
Filename :
5405694
Link To Document :
بازگشت