A New Approach for Keyword Cover Search

Y. Nagendar, V. Charan

Abstract


Spatial databases area unit stores the knowledge concerning the spatial objects that area unit related to the keywords to point the knowledge like its business/services/features. Best keyword
cover question aims to search out objects related to keywords. The method planned considers keyword rating, keyword connection and spatial connection. This can be the most reason for developing this new algorithmic program referred to as Best keyword cowl that is considers inter-distance still because the rating provided by the shoppers through the web business review sites. Nearest keyword search algorithm combines the objects from completely different question keywords to generate candidate keyword covers. Baseline algorithmic program and keyword nearest neighbor enlargement algorithms area unit wont to notice the best keyword cowl. The performance of the nearest keyword algorithm drops dramatically, once the amount of question keyword will increase. In comparison with the baseline algorithmic program, keyword-NNE algorithmic program immensely reduces the amount of candidate keyword covers generated.


Full Text:

PDF




Copyright (c) 2017 Edupedia Publications Pvt Ltd

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

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org