Abstract: To evaluate multiple continuous k nearest neighbor queries on highly dynamic moving objects, we proposed an algorithm for processing Query Index based Multiple Continuous K-Nearest Neighbor Qucrics(QI-MCKNN)，discussed the conception of Query Index and the solution to construct the grid index, analyzed the effect of grid size on query processing,and provided the corresponding procedure. Finally experimental results verify that when dealing with highly dynamic moving objects,the proposed algorithm is much more effective than the traditional SEA-CNN algorithm which is based on the objects index

Key words: Highly dynamic, Continuous k nearest neighbors queries, Grid index, QI-MCKNN algrithm