Shilpa B. Patil, Sushma S. Nandgaonkar
Abstract: With rapid growth of mobile users it is essential to optimize nearest neighbor retrieval. Even though many approaches available for searching the spatial query, modern technology requires some enhancements for the optimality. The results based on the s, and spatial query are combinations of a location and set of features. System returns the nearest neighbor of users current location based on specified query and for speeding up the process of spatial queries, IR2-tree is used. There are some drawbacks of this data structure. In order to overcome this spatial inverted index can be used which improves query processing significantly. However, it works with single level gap-keeping. In this paper we use two level gap-keeping to save space cost.
Keywords: Search, Spatial Data Mining, Nearest Neighbor Search, Index Compression