Improving query processing performance using optimization among CPEL factors

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Query services in public servers are interesting factor due to its scalability and low cost. The owner of the data needs to check confidentiality and privacy before moving to server. The construction of cloud query services requires confidentiality, privacy, efficiency and low processing cost. In order to improve the efficiency of query processing, the system will have to compromise on computing cost parameter. So finding appropriate balance ratio among CPEL, is an optimization problem. The genetic algorithm can be the best technique to solve optimal balancing among CEPL (confidentiality, privacy, efficiency, and low cost). In this paper we propose a frame work to improve query processing performance with optimal confidentially and privacy. The fast KNN-R algorithm is designed to work with random space perturbation method to process range query and K-nearest neighbor queries. The simulation results show that the performance of fast-KNN-R algorithm is better than KNN-R algorithm.

Cite

CITATION STYLE

APA

Kiran Kumar, R., & Suresh, K. (2014). Improving query processing performance using optimization among CPEL factors. In Advances in Intelligent Systems and Computing (Vol. 327, pp. 51–58). Springer Verlag. https://doi.org/10.1007/978-3-319-11933-5_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free