Studies on kNN query of moving objects for location management in spatial database

With mobile technology deepening and applications developing, quantity of moving objects is increasing explosively, which impels development of moving objects database (MOD). As critical technology of MOD, moving objects indexing structure and its accessory algorithms affect performance of applications directly. This chapter presents a Branch-and-Bround algorithm based M2TPR-tree multi-time parameter approximation expression, and improves query efficiency of polygon objects moving kNN algorithm. This chapter also presents the radius of MPB-tree-based iterative algorithm which can efficiently complete point-like objects moving kNN query.