Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
Nowadays, data analytics in spatial database objects are associated with keywords. In the past decade, searching the keyword was a major focusing and active area to the researchers within the database server and information retrieval community in various applications. In recent years, the maximising the availability and ranking the most frequent keyword items evaluation in the spatial database are used to make the decision better. This motivates to carry out research towards of closest keyword cover search, which is also known as fine tuned keyword cover search methodology; it considers both inter object distance and keyword ranking of items in the spatial environment. Baseline algorithm derived in this area has its own drawbacks. While searching the keyword increases, the query result performance can be minimised gradually by generating the candidate keyword cover. To resolve this problem a new scalable methodology can be proposed in this paper.
International Journal of Enterprise Network Management – Inderscience Publishers
Published: Jan 1, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.