@article{MAKHILLAJIT20201996802,
    title = {Reducing the Search Space in Real-Road Shortest Path Finding using Elliptical Pruning With
Geographical Databases},
    journal = {Asian Journal of Information Technology},
    volume = {19},
    number = {9},
    pages = {163-170},
    year = {2020},
    issn = {1682-3915},
    doi = {ajit.2020.163.170},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2020.163.170},
    author = {P.,S.,R. and},
    keywords = {Map pruning,shortest path,map queries,Elliptical pruning and geographical databases},
    abstract = {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.}
    }