Efficient and Faster Method for QueryDependent Local Landmark Scheme

Abstract

In early days the size of graph become huge that’s why finding shortest distance between queried node is necessary. A lots of methods have been already established just like Dijkshtra’s algorithm, A* search algorithm invented by different authors to find shortest distance between two queried nodes. All of these existing systems make use of landmark embedding approach, that select a set of graph nodes as landmarks and then find the earliest distances from each landmark to all nodes. The local landmark scheme has been developed by Miao Qiao et al. Which find local landmark reliant on queried node and then distance among these two queried nodes is calculated as sum of their shortest distance to local landmark which is earlier than global one. These systems acquire extra computation time. To get distance estimation correctness and rapid computation method we develop Efficient Structure for Query-Dependent Local Landmark Scheme to extent previously presented robust method with improved SPT approach.