DocumentCode
3107295
Title
Nearest Neighbor Query of Moving Objects Based on Spherical Safe Area
Author
Du Zhongjun ; Zhou Zongyi
Author_Institution
Coll. of Comput. Sci., Sichuan Univ., Chengdu, China
fYear
2011
fDate
16-18 Aug. 2011
Firstpage
1
Lastpage
4
Abstract
The nearest neighbor wouldn´t be replaced by any other dataset while query point didn´t cross over the border of the safe area. However, it is hard to work out the traditional safe area which is an irregular spatial region. In this paper, we designed spherical safe area to resolve the above-mentioned problem, and proved the procedure of calculation is foolproof. Considering about the particular nature of moving object compared to fixed base station, in order to share the work pressure of moving object, the nearest neighbor query management would work on the nearest fixed base station instead of moving object. Based on the above-mentioned design, we developed NN management system which works on fixed base station and ClientMS system running on moving object. According to Comparison and analysis of experimental data, we verified the efficiency of real-time update algorithm for nearest neighbor query of moving objects based on spherical safe area.
Keywords
client-server systems; query processing; visual databases; NN management system; base station; client MS system; irregular spatial region; moving object database; nearest neighbor query; real-time update algorithm; spherical safe area; Algorithm design and analysis; Artificial neural networks; Delay; Indexing; Nearest neighbor searches; Real time systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Internet Technology and Applications (iTAP), 2011 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-7253-6
Type
conf
DOI
10.1109/ITAP.2011.6006356
Filename
6006356
Link To Document