Abstract: CKNN (Continuous k-Nearest Neighbor) queries in road networks have recently received many attentions in moving objects databases. In this paper,we presented a novel road networks directional graph model and use memory-resident grid cell structure and linear list structures to store the moving objects and road network directional model. By introducing directional network distance measurement we proposed the directional network expansion (DNE) algorithm to reduce the network searching cost of CKNN ctueries processing. Experimental results show that the DNE algorithm outperforms existing algorithms.

Key words: CKNN queries,Road networks,Directional graph model,DNE algorithm