Abstract: Aiming at the issue of geography information query, a new k-Nearest Neighbor algorithm for dynamic road network was proposed based on routing mechanism. With the idea of "space for time"，we saved history query results in routing tables,and substituted the traditional method by requiring tables. We updated the route tables to adapt the time varying road status. With the kernel of routing table, we improved the filtering and refining procedure of kNN algorithm. I3y preprocess of dynamic road network using routing table, the amount of candidate points in k-NN computing is reduced, and the rang of query and the searching efficiency are promoted.

Key words: Routing mechanism, k-nearest neighbor algorithm, Dynamic road network