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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proceedings of ACM SIGMOD Conference (2004)
Chen, K., Kavuluru, R., Guo, S.: Rasp: Efficient multidimensional range query on attack-resilient encrypted databases. In: ACM Conference on Data and Application Security and Privacy, pp. 249–260 (2011)
Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Proceedings of Very Large Databases Conference, VLDB (2004)
Liu, K., Giannella, C.M., Kargupta, H.: An attacker’s view of distance preserving maps for privacy preserving data mining. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 297–308. Springer, Heidelberg (2006)
Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. ACM Computer Survey 45(6), 965–981 (1998)
Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage. In: ACM Conference on Computer and Communications Security (2008)
Hu, H., Xu, J., Ren, C., Choi, B.: Processing private queries over untrusted data cloud through privacy homomorphism. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 601–612 (2011)
Papadopoulos, S., Bakiras, S., Papadias, D.: Nearest neighbor search with strong location privacy. In: Proceedings of Very Large Databases Conference, VLDB (2010)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. John Wiley & Sons, Inc., New Jersey (2004)
Vardi, M.: Logic and automata: A match made in heaven. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, Springer, Heidelberg (2003)
Tan, R.: Seeking the profitability-risk-competitiveness frontier using a genetic algorithm. Journal of Actuarial Practice 5(1), 49 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kumar, R.K., Suresh, K. (2015). Improving Query Processing Performance Using Optimization among CPEL Factors. In: Satapathy, S., Biswal, B., Udgata, S., Mandal, J. (eds) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. Advances in Intelligent Systems and Computing, vol 327. Springer, Cham. https://doi.org/10.1007/978-3-319-11933-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-11933-5_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11932-8
Online ISBN: 978-3-319-11933-5
eBook Packages: EngineeringEngineering (R0)