The invention discloses a shortest path batch query method in a road network. The method comprises the following steps: performing
similarity matching on a query and any query in a given query
result set; on the basis of the constructed query matching strategy, obtaining a to-be-queried shortest path according to the shortest path corresponding to query in the query
result set, putting the to-be-queried shortest path into a cache set which is initially a null set, and taking the to-be-queried shortest path as a to-be-queried set until the cache set reaches the maximum capacity or the maximum storage time; decomposing the query set into a plurality of query subsets through a query
decomposition strategy, and sequentially obtaining a main query and an auxiliary query of each query subset; adding a source vertex of the main query as a path into a defined heap set, obtaining a new path based on a constructed path expansion strategy, and adding the new path into the heap set according to an increasing sequence of the estimated shortest
path distance to obtain a main
query expansion heap; storing the source vertex of the secondary query as a path into the defined reservation heap, and obtaining the secondary query reservation heap based on the constructed path reservation strategy; and on the basis of the constructed path replacement strategy, obtaining the shortest path of all queries in the query set according to the main
query expansion heap and the auxiliary query reservation heap. The method solves the problems that according to an existing shortest path query method, query needs to be subjected to a complex
decomposition process, meanwhile, a large number of caches need to be constructed to match responses, the calculation efficiency of the query process is greatly reduced, and the storage cost is increased.