K-NNE ALGORITHM FOR BEST KEYWORD COVER SEARCH

Computer Engineering

Spatial databases stores the knowledge regarding the spatial posts which are related with the keywords featuring the knowledge like their business/administrations/ highlights Crucial situation called nearest keyword search is obviously to inquiry items called keyword cover In nearest keyword search it covers a couple of query keywords and minimal range between objects From latest few years keyword rating builds their convenience and significance in protest examination for the decision making This is actually the principal purpose for building the new algorithm called Best keyword cover which thinks inter range and also the ratings gave by the clients through the web business review destinations Best keyword search algorithm mixes the items from various query keywords to a create candidate keyword cover Two algorithms Base line algorithm and keyword nearest neighbor expansion algorithms are used to find best keyword cover The efficiency of the closest keyword algorithm declines drastically when just how several query keyword increases The right solution is of this problem of the existing algorithm this function proposes common variation called keyword nearest neighbor expansion which decreases the resulted candidate keyword covers

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.