Multi-keyword score threshold and B+ tree indexing based top-K query retrieval in cloud
- PDF / 1,041,380 Bytes
- 11 Pages / 595.276 x 790.866 pts Page_size
- 20 Downloads / 161 Views
Multi-keyword score threshold and B+ tree indexing based top-K query retrieval in cloud K. Karthika Lekshmi 1 & M. Vigilson Prem 2 Received: 26 May 2019 / Accepted: 17 July 2019 # Springer Science+Business Media, LLC, part of Springer Nature 2019
Abstract Cloud computing is an emerging technology where computing resources are delivered as a service over a network which is accessed by many cloud users. Cloud services on the real-world application attain the fundamental resource sharing and low-cost preserving characteristics. While increasing the number of user requests, the most significant deal is the identification and retrieval of top-k queries in cloud environments. Several techniques have been developed to retrieve the top-k queries, but effective modeling of query result retrieval on cloud services with less complexity is not attained. In order to improve the query result retrieval rate, Top-k Query Multi-Keyword Score Threshold (Top-k QMKST) technique is developed. This technique considers four processes for retrieving the top-k results in minimum time. At first, multiple keywords are extracted from the query, and then the B+ tree indexing is used to index the data with the objective of reducing the response time and space complexity. Third, a score value is calculated using Kullback–Leibler Divergence which provides the probable results of keywords occurrences among a collection of keywords in an index list. At last Monotonic weighted score aggregation function is used for assigning the weight to the resultant content score. Experimental evaluation is carried out with different parameters and the results showed that the Top-k QMKST technique is better in case of query result retrieval with minimum false positive rate, reduced response time and space complexity. Keywords Cloud computing . Top-k query retrieval . B+ tree index . Kullback–Leibler divergence . Score threshold . Monotonic weighted score aggregation function
1 Introduction Top-k query result retrieval is the most significant process in the field of cloud computing due to the rapid growth of cloud users. The cloud server receives the incoming user requested queries and fetches the accurate results from the corresponding cloud owners to offer the services to different cloud users. This article is part of the Topical Collection: Special Issue on AI-based Future Intelligent Internet of Things Guest Editors: Kelvin K.L. Wong, Quan Zou, and Pourya Shamsolmoali * K. Karthika Lekshmi [email protected] 1
Department of Information Technology, Cape Institute of Technology, Tirunelveli, Tamil Nadu, India
2
Department of Computer Science and Engineering, R.M.K. College of Engineering and Technology, Kavaraipettai, Tamil Nadu, India
A Close Dominance Graph (CDG) model was developed in [1] to handle the processing of a continuous top-k dominating query. The CDG model failed to implement in distributed computing environments. A flexible multi-keyword query method (MKQE) was introduced in [2] for minimizing the maintenance overhead during the ke
Data Loading...
