• B. SATYA MOUNIKA
• J. VENKATA KRISHNA

Many search engines are used to search anything from anywhere; this system is used to fast nearest neighbor search using keyword. Existing works mainly focus on finding top-k Nearest Neighbors, where each node has to match the whole querying keywords .It does not consider the density of data objects in the spatial space. Also these methods are low efficient for incremental query. But in intended system, for example when there is search for nearest restaurant, instead of considering all the restaurants, a nearest neighbor query would ask for the restaurant that is, closest among those whose menus contain spicy, brandy all at the same time, solution to such queries is based on the IR2-tree, but IR2-tree having some drawbacks. Efficiency of IR2-tree badly is impacted because of some drawbacks in it. The solution for overcoming this problem should be searched. The spatial inverted index is the technique which will be the solution for this problem.

Access control, e -health, privacy preserving, cloud computing.

"Searching of Nearest Neighbor Based on Keywords using Spatial Inverted Index", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.3, Issue 10, page no.110-116, October-2016, Available :http://www.jetir.org/papers/JETIR1610014.pdf

"Searching of Nearest Neighbor Based on Keywords using Spatial Inverted Index", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.3, Issue 10, page no. pp110-116, October-2016, Available at : http://www.jetir.org/papers/JETIR1610014.pdf