Research on Optimizing Strategy of Database-oriented GIS Graph database Query

In the grid GIS graph database, as the network scale increases, the time complexity of solving the shortest path increases sharply. This restricts the rapid development of the research and application of complex networks. To improve query efficiency, node blocking strategies are introduced. On the basis of the bidirectional search of the breadth-first search algorithm (BFS), using the results of the single-source shortest path node that has been obtained, the solution of the shortest path point-to-point implementation is accelerated. A node filtering algorithm is proposed. The algorithm can filter out most of the nodes that are not optimal paths. Finally, experiments on real data sets are used to verify the effectiveness of the algorithm.