next up previous
Next: RELATED WORK Up: OORF: AN OBJECT-ORIENTED ROUTE Previous: ROUTE FINDING ALGORITHM

EVALUATION

The purpose of developing this data model was to give a helpful base to find a good approach for solving the route finding problem. We believe we have succeeded. After designing the Road Network Data Model we argue how it is helpful in solving the route finding problems.

Firstly, we have divided the road network in a country into road sub-networks contained in administrative areas. Any temporary information/caution about the sub road network for example, repair of roads etc., in any administrative neighbourhood can be put into that neighbourhood enhancing the responsibilities of that neighbourhood. This type of informations will avoid not usable paths as a result. It also saves a great deal of system memory space because only the required neighbourhood of interest with the required type of roads will be loaded into the memory from disk. This is also possible in case of source and destination points in different neighbourhood. In that case only the road sub-networks in both the neighbourhood and the major road network in the geo-object containing source and destination neighbourhood will be loaded into the main memory.

Secondly, we have divided each road into composite segments in such a way that every segment of any road provides all the informations about the whole road. This is helpful when user want to get information from a road object through which cities it passes. Moreover, we can also add other informations such as road facilities, public areas etc., in the road objects. The peak hours of traffic on a road is also added in each of the road and it will be helpful when a driver don't want to go by such a road and can select an alternate path. All this was possible by using powerful object orientation concepts such as containment and composit hierarchy.


next up previous
Next: RELATED WORK Up: OORF: AN OBJECT-ORIENTED ROUTE Previous: ROUTE FINDING ALGORITHM
M.Abaidullah ANWAR
1999-11-25