Performing Best Keyword Cover Search using K-NNE Algorithm

Spatial databases stores the info regarding the spatial articles which are related with the keywords showing the info, like, its business/administrations/ highlights. Important issue called nearest keyword search is obviously to inquiry objects, called keyword cover. In nearest keyword search, it covers a set of query keywords and minimum distance between objects. From latest few years, keyword rating builds its accessibility and significance in protest assessment for the decision making. Here is the main purpose for developing the new algorithm called Best keyword cover which considers inter distance and also the rating gave by the clients through the online business survey destinations. Closest keyword search algorithm combines the objects from various query keywords to a generate candidate keyword cover. Two algorithms Base-line algorithm and keyword nearest-neighbor expansion algorithms are accustomed to find best keyword cover. The performance of the closest keyword algorithm drops drastically, when just how many query keyword increases. The perfect solution is of this dilemma of the existing algorithm, this work proposes generic version called keyword nearest neighbor expansion which reduces the resulted candidate key-word covers.