TY  - JOUR
T1  - Reducing the Search Space in Real-Road Shortest Path Finding using Elliptical Pruning With
Geographical Databases
AU - Ganesh Kumar, P. AU - Karthik, S. AU - Nidhya, R. AU - Bhavadharini, R.M. 
JO  - Asian Journal of Information Technology
VL  - 19
IS  - 9
SP  - 163
EP  - 170
PY  - 2020
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2020.163.170
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2020.163.170
KW  - Map pruning
KW  -shortest path
KW  -map queries
KW  -Elliptical pruning and geographical databases
AB  - Real-road shortest-path finding algorithms
involve large set of geographical data which include
geo-tagged nodes and edges of the road network. Practical
shortest path finding algorithms need minimized
search-space for performing these computations by
keeping these data in the computer’s conventional
memory. The hierarchical pruning methods for
minimizing the search-space to support real-road shortest
algorithms are more suitable for connecting multiple cities
and towns via highways. This study is to present a new
suitable pruning method for intra-city shortest path
finding, called elliptical pruning to bring the geo-tagged
nodes and edges in to the memory for the subsequent
shortest path finding process for the complex city
road-transport networks.
ER  -