A Method of Querying the Shortest Path Between Two Points on a Graph

Abstract

The invention relates to a method for inquiring the shortest path between two points on a map, which includes steps of 1) randomly extracting a plurality of points to serve as supporting points from the map and calculating the betweenness estimated value of each point from the map according to the shortest paths among the supporting points; 2) utilizing the point with the betweenness estimated value higher than the preset value, adding the information of the shortest path between each point to each center point on the map into hop information of each point on the map and marking a set of the center points as a Wb; 3) removing the Wbs on the map, then dividing the map into a plurality of small maps Si and obtaining a point cut set Ws; 4) obtaining the hop information of all points in each small maps Si according to the shortest path between any two enumerated points of the small map Si; 5) acquiring the hop information among different small maps according to the shortest path between each point in the Wb and each point in the Ws; and 6) obtaining the shortest path between two inquired points input by the user according to the hop information of each point on the map. The method for inquiring the shortest path between two points on the map is feasible, high-efficiency and capable of computing the hop information on the large map within acceptable time.

Description

technical field [0001] The invention relates to database technology and graph data management, and mainly relates to a software implementation method for processing the shortest path query between two points based on 2-hop for large-scale graphs. Background technique [0002] Graph database is a new type of database technology that uses the structure and properties of graphs to represent and store information, and is a type of NoSQL database. A graphic database is a data set that uses computers to store the basic elements of points, lines, and graphs in a certain row. elements, and these graph elements are set up according to a certain data structure (usually a topological data structure). It includes two levels: the first level is the data collection of topological coding, which is composed of data files describing the relationship between graph elements such as points, lines, and planes, including polygon files, line segment files, node files, etc. The files are connecte...

AI Technical Summary

Problems solved by technology

However, some of these methods are based on the improvement of Dijkstra's algorithm, and the search efficiency of these algorithms is limited; others improve the efficiency of path query by constructing distance information indexes on the points on the graph, but the existing The scalability of these indexing methods is not strong, and it cannot meet the path query requirements on the graph with a large amount of data.

It can be seen that the traditional graph database technology has been unable to meet the growing demand for graph data applications.

Images