EFFECTIVELY MINIMIZE THE OVERALL TRIP DISTANCE USING CONTINUOUS DETOUR QUERY IN SPATIAL NETWORK

The top-k shortest path discovery is a key process on graphs to determine k-shortest paths between a two nodes
with the minimal length. This work precisely holds three processes for ranking the shortest path problem without loop by the way of using top-k shortest path join (TKSPJ) in spatial network. First, Construct transformed graph with side cost by using of input original graph. Second, structural encoding label is used for loop detection and third to find top k shortest path without loop. The main advantage of this work is to reduce the cost and prune the search space. The pre computed shortest paths translating the original graph based on the threshold value has also been introduced, to reduce the search space in a spatial network.