With the development of mobile Internet technology, the road network in the real world is becoming larger and more complex, and the real-time response to the shortest distance query has become a high requirement for many industrial applications. Many existing approaches, such as G-tree or G∗-tree, have been proposed to answer such search problems, however, these approaches are not efficient enough in dealing with very large graphs. To this end, we propose a novel index called LG-tree, which partitions the large graph into sub-graphs, and then ...
