• V.S.MADHUMATHI
• T.SOUNDER RAJAN

The Location-aware keyword query returns ranked objects that are near a query location and that have textual descriptions that match query keywords.IR2-tree is used for finding nearest neighbor. Compression scheme and object aggregation method based on spatial inverted index. Spatial Inverted Index has collections of spatial represent points are conferred with the collections of key word .Compression scheme reducing the space cost. Object aggregation is done by grouping the aggregative objects to retrieve the placement and textual dependent data. Priority level search is used to search the objects based on the priority given for the keywords depends on the user.This method has few drawbacks. To overcome this technique, Using Group nearest neighbor search algorithm group the object .In GNN algorithm it has two techniques such as Location based service and Euclidean Distance .Location based service used to retrieve the location using algorithm. Euclidean Distance are using the formula find the distance. When using these algorithms, its fully efficient and more accurate .The optimized groups of objects are retrieved.

GNN, Spatial database, nearest neighbor search, spatial index, keyword search

"Efficient Query Retrevial Using Group Nearest Neighbour Algorithm ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.2, Issue 4, page no.1175-1179, April-2015, Available :http://www.jetir.org/papers/JETIR1504062.pdf

"Efficient Query Retrevial Using Group Nearest Neighbour Algorithm ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.2, Issue 4, page no. pp1175-1179, April-2015, Available at : http://www.jetir.org/papers/JETIR1504062.pdf