An Optimal Route Search Using Spatial Keyword Query using Keyword Nearest Neighbor Expansion

Abstract

In our daily life the need to find optimal routes between the two points is critical, for instance finding the shortest distance to the nearest hospital. The internet based maps are now generally used for this purpose. Route search and optimal route queries are two significant classes of queries based on the road network concept. Route search queries find the route based on the given constraints. The optimal route queries find the optimum route from a set of specifications by a user. In the road map queries, users would have to give the specification of the starting point and the ending point of their travelling with or without the constraints. A few spatial features about the categories and the different locations should be specified along with this. If the travelling constraints are given then it should be unique. These constraints may be either a total order or a partial order. In this specification order there should be information about both the starting point and the destination point of the travelling. The optimal route queries optimize the possible routes and give the optimal route that meets all the constraints. This paper describes the survey on optimal route query processing, two categories namely optimal route query processing and spatial search with categorical information have been considered, an analysis on technique for optimal route query with constraints and without constraint is also included. The total order needs a specification of list of points and in the same order that they should be visited but that is not required for partial order constraints. Lastly this paper concludes with pros and cons of different techniques under optimal route queries.