Shortest Route Finding using an Object-oriented Database Approach

Abstract

The huge and complex road networks in a country make it challenging to find the best route for roaming around.  Therefore,  it is  necessary  to arrange  the data  in such  a  way  that  its retrieval,  especially a  part  of  the  road  or  road  sub-network ,  should  be  efficient  and  needless  data processing is avoided. This paper presents  an object-oriented road  network  database  model  in  which  we divide  the  road  into road segments and road network into road sub-networks, into levels  according to the administrative in  which  a  country  is  divided  administratively.  The implementation of the model for shortest route finding has proved that model is efficient and effective.

Keywords: Geographic Information Systems, Dijkstra’s algorithm, Road Subdivision, Composite and Containment Hierarchies