Multi-type K nearest neighbor queries in road networks

Multi-type nearest neighbor queries of spatial database has received more and more attention gradually,there are many researches of the K nearest neighbor queries,but the research on the multi-type K nearest neighbor queries are still blank.Aiming at the Multi-Type K Nearest Neighbor queries (MT-KNN) problem,combining the theory of multi-type nearest neighbor queries and K nearest neighbor query,a multi-type K nearest neighbor queries algorithm is put forward.A hierarchical encoded path view is extended,a multi-path hierarchical encoded view is established.By gradual growing the current partial path,the algorithm implements the multi-type K nearest neighbor queries.Experimental results show that the algorithm has better performance.