Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{144645,
        author = {K. Swathi},
        title = {An Optimal Best Keyword Cover Search},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {3},
        number = {2},
        pages = {265-268},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=144645},
        abstract = {From latter few years, keyword rating increases its availability andr ank in object evaluation for the decision making. This is the main motive for developing this new algorithm called Best keyword cover which is deliberates inter distance as well as the rating provided by the customers through the online business review sites. Closest keyword search algorithm combines the objects from various query keywords to a generate candidate keyword cover. Two algorithms Base-line algorithm and key word n earest-neighbor expansion algorithms are used to finding best keyword cover. The performance of the closest keyword algorithm drops vividly, when the number of query keyword increases. The solution of this problem of the existing algorithm, this work proposes generic version called keyword nearest neighbor expansion which decreases ther esulted candidate key-word covers.},
        keywords = {Spatial -database, point of the interests, query keywords, keyword ratings, key-word cover.},
        month = {},
        }