Improving Query Processing Performance Using Optimization among CPEL Factors

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.

[1]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[2]  Gene Tsudik,et al.  A Privacy-Preserving Index for Range Queries , 2004, VLDB.

[3]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[4]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[5]  Stavros Papadopoulos,et al.  Nearest neighbor search with strong location privacy , 2010, Proc. VLDB Endow..

[6]  Moshe Y. Vardi Logic and Automata: A Match Made in Heaven , 2003, ICALP.

[7]  Keke Chen,et al.  RASP: efficient multidimensional range query on attack-resilient encrypted databases , 2011, CODASPY '11.

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Jianliang Xu,et al.  Processing private queries over untrusted data cloud through privacy homomorphism , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[10]  Kun Liu,et al.  An Attacker's View of Distance Preserving Maps for Privacy Preserving Data Mining , 2006, PKDD.

[11]  Johannes Fürnkranz,et al.  Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings , 2006, PKDD.

[12]  Ramakrishnan Srikant,et al.  Order preserving encryption for numeric data , 2004, SIGMOD '04.

[13]  Peter Williams,et al.  Building castles out of mud: practical access pattern privacy and correctness on untrusted storage , 2008, CCS.