ijaser
IJASER publishes high-quality, original research papers, brief reports, and critical reviews in all theoretical, technological, and interdisciplinary studies that make up the fields of advanced science and engineering and its applications.
In the present Internet decade, searching is a major requirement of people for various purpose.
Nearest neighbour search is key issues in business development, ad-hoc network, VANET and decision
making. In the nearest neighbour search, inverted index is the most popular data structure used in object
retrieval. To reach the object in the shortest way is major concern in this issue. Inverted index that extends
the inverted list to cope with multidimensional data.System use R-tree to browse the points of all relevant
lists which is in ascending order of their distance to the query point. Using bit string computation, the false
hit problem is addressed.IR2-tree is not sufficient to give real time response. Inthe Proposed system, the
inverted index algorithm is enhanced to display not only the best first result but also the complete nearest
neighbour destinations available in the prioritized order.