1136 | Page Fast Nearest Neighbor Search with Keywords Using IR2-Tree Prof. Pramod Khandare 1 , Prof. Ganesh Shinde 2 Principal, SIET(Poly), Paniv, Paniv, (India) HOD Computer Tech, SIET (Poly), Paniv, Paniv, (India) ABSTRACT Conventional abstraction queries, like vary search and nearest neighbor retrieval, involve alone conditions on objects geometric properties. Today, many trendy applications concern novel varieties of queries that aim to go looking out objects satisfying every a abstraction predicate, and a predicate on their associated texts. As associate example, instead of considering all the restaurants, a nearest neighbor question would instead provoke the eating place that is the nearest among those whose menus contain asteak, ˆ spaghetti, brandyaˆ all at identical time. Currently, the best answer to such queries depends on the IR2-tree, which, as shown throughout this paper, contains many deficiencies that seriously impact its efficiency. motivated by this, It tend to develop a latest access methodology called the abstraction inverted index that extends the traditional inverted index to subsume f-dimensional info, and comes with algorithms that will answer nearest neighbor queries with keywords in real time. As verified by experiments, the projected techniques trounce the IR2-tree in question latent amount considerably, generally by a part of orders of magnitude. – Keywords: NEAREST NEIGHBOR SEARCH, IR2-TREE, NEAREST, RANGE SEARCH, SPATIAL INVERTED INDEX I. INTRODUCTION A Spatial Information that manages multidimensional objects and provides fast Objects on different selection criteria based on access. The importance of spatial databases feature is reflected by a geometric reality of entities modeled for. For example, the location of restaurants, hotels, hospitals And so on a map are represented as points, while Parks, lakes, and the landscape as often as large extents a combination of rectangles. Many functionality of a spatial there are various ways in which specific references useful database. For example, in geography information system Division Search all restaurants can be deployed to search for a particular nearest neighbor retrieval search whiles the restaurant area, Closest to a given address. A spatial database manages multidimensional objects (such as points, rectangles, etc.), and provides fast access to those objects based on different selection criteria. The importance of spatial databases is reflected by the convenience of modeling entities of reality in a geometric manner. For example, locations of restaurants, hotels, hospitals and so on are often represented as points in a map, while larger extents such as parks, lakes, and landscapes often as a combination of rectangles. Many functionalities of a spatial database are useful in various ways in specific contexts. For instance, in a geography information system, range search can be deployed to find all restaurants in a certain area, while nearest neighbor retrieval can discover the restaurant closest to a given