Best optimal route cover search using spatial keyword covering

Abstract

Business features are indicated with the help of keywords in spatial database. While retrieving data from spatial database a problem occurs and named as Closest Keyword Cover Search, problem occurs due to set of query keywords and minimum inter object distance between them. Object evaluation for the best decision making depends on the increase of availability and keyword rating. Closest keywords search is extended to Best Keyword Cover deals with inter object distance and keyword rating in more standard manner. Initially baseline algorithm is used to overcome the problem mentioned and it is not applicable for real time databases, in order to overcome this a new algorithm is proposed and named as Keyword Nearest Neighbor Expansion it reduces the number of candidate keyword covers compared to baseline algorithm. With the help of K-NNE algorithm local best solution is obtained and generates less new candidate keyword covers compared to baseline algorithm.