Keyword NNE for the Fast Keyword Cover Search

Mobile computing is very wide popular and so as its applications. Along with it, accessing position based
services of the objects have increased the use of spatial object search. Spatial database contains each object as
group of keywords associated with it. Keyword rating plays important role in deciding about the objects
importance. Considering all these promoted a design that uses inter object distance and service rating of an
object called closet keyword search, which improves decision making process. The knne algorithm which can
be applied with additional dimension and which can consider more number of keywords in the query is used
here. Baseline algorithm can do same task. Baseline is based on grouping concept, objects from various
keywords form intermediate candidate keywords. Algorithm shows poor performance as keywords are
increased. K_nne is used which generates less number of candidate keyword covers, which resolves the
problem and improves the performance