Abstract: Fast nearest Neighbor Search with Keywords involve condition on objectís geometric properties.In todayís application many queries that aim to seek out out objects satisfying each a abstraction predicate, and a predicate on their associated texts. example of the above condition is consider all restaurants , a nearest neighbor question would instead extract the eating house thatís the highest among those whose menus contain steak, spaghetti, brandy all at an equivalent time. in this paper effective resolution to such queries is predicated on the IR2-tree, features a few deficiencies that seriously impact its potency we have to develop a replacement access methodology known as the abstraction inverted index.the purpose of inverted index is to address flat knowledge and come with algorims that may answer nearest neighbor queries with keywords in real time.

Keywords: R-tree, UML, diagrams, brandy, index, R-tree.