Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Maximising the efficiency of keyword analytics framework in wireless mobile network management

Maximising the efficiency of keyword analytics framework in wireless mobile network management 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Enterprise Network Management Inderscience Publishers

Maximising the efficiency of keyword analytics framework in wireless mobile network management

Loading next page...
 
/lp/inderscience-publishers/maximising-the-efficiency-of-keyword-analytics-framework-in-wireless-tLRq8iUrbt

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1748-1252
eISSN
1748-1260
DOI
10.1504/IJENM.2020.106314
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

International Journal of Enterprise Network ManagementInderscience Publishers

Published: Jan 1, 2020

There are no references for this article.