Shortest Path Estimation for Graph Data Using a Relational Technique
Priyanka Naphade, Yashawant Dongre · International Journal of Database Management Systems · 2015
Recently graph data rises in many applications and there is need to manage such large amount of data by performing various graph operations over graphs using some graph search queries.Many approaches and algorithms serve this purpose but continuously require improvement over it in terms of stability and performance.Such approaches are less efficient when large and complex data is involved.Applications need to execute faster in order to improve overall performance of the system and need to perform many advanced and complex operations.Shortest path estimation is one of the key search queries in many applications.Here we present a system which will find the shortest path between nodes and contribute to performance of the system with the help of different shortest path algorithms such as bidirectional search and AStar algorithm and takes a relational approach using some new standard SQL queries to solve the problem, utilizing advantages of relational database which solves the problem efficiently.