An Efficient And Robust Method To Find The Nearest Neighbor Using Spatial Inverted Index

Many applications require finding the nearest objects closest to a specified location that contains a keywords. Nearest neighbor queries that aims to find objects both a spatial predicate and predicate on their associated texts. For example a nearest neighbor query search restaurant that is the closest among many restaurants within a particular area, whose menu contain required food keyword with respect to query. The problems of the nearest neighbor search on spatial data and keyword search on text data have been studied separately. Existing solution to queries is based on IR2-Tree (Information Retrieval R-Tree), but it has a few deficiencies that it requires more time to process the query and fails to give real time answers. To overcome these problems, we present an efficient access method to answer spatial keyword queries. we introduce an indexing structure called spatial inverted index that extends the inverted index.