Open Access   Article Go Back

Building an Effective and Comfy Query services with RSAP Data Perturbation in the Cloud

K.P. Kumar1 , Z. Mihret2

  1. Dept. of Computing, Adama Science and Technology University, Adama, Ethiopia.
  2. Dept. of Computing, Adama Science and Technology University, Adama, Ethiopia.

Correspondence should be addressed to: praveen.katukojwla99@gmail.com.

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-5 , Page no. 120-123, May-2017

Online published on May 30, 2017

Copyright © K.P. Kumar, Z. Mihret . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: K.P. Kumar, Z. Mihret, “Building an Effective and Comfy Query services with RSAP Data Perturbation in the Cloud,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.120-123, 2017.

MLA Style Citation: K.P. Kumar, Z. Mihret "Building an Effective and Comfy Query services with RSAP Data Perturbation in the Cloud." International Journal of Computer Sciences and Engineering 5.5 (2017): 120-123.

APA Style Citation: K.P. Kumar, Z. Mihret, (2017). Building an Effective and Comfy Query services with RSAP Data Perturbation in the Cloud. International Journal of Computer Sciences and Engineering, 5(5), 120-123.

BibTex Style Citation:
@article{Kumar_2017,
author = {K.P. Kumar, Z. Mihret},
title = {Building an Effective and Comfy Query services with RSAP Data Perturbation in the Cloud},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2017},
volume = {5},
Issue = {5},
month = {5},
year = {2017},
issn = {2347-2693},
pages = {120-123},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1275},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1275
TI - Building an Effective and Comfy Query services with RSAP Data Perturbation in the Cloud
T2 - International Journal of Computer Sciences and Engineering
AU - K.P. Kumar, Z. Mihret
PY - 2017
DA - 2017/05/30
PB - IJCSE, Indore, INDIA
SP - 120-123
IS - 5
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
566 356 downloads 448 downloads
  
  
           

Abstract

Presently a day`s cloud is more prominent well known because of the reality in cloud clients have the information and transfer gigantic contained insights. It has enormous databases to database supplier sellers so database supplier suppliers keep the offerings of assortment inquiry offerings. In blurring system, a couple of clients have a tricky individual records in that situation purchasers can`t move the records for facilitating until we offer wellbeing, classification, immaculateness, address privateness are ensured to the facilitated actualities. In this paper, we proposed new contraption that is RASP RAndom space Perturbation. In this approach enhance the range seek with more grounded assaults that recovering than officially show techniques. In RASP is actualities bother way to deal with upgrade secured and proficient question, kNN inquiry bearer offers the included data inside the cloud. In RASP records bother approach consolidate dimensionality development and request protecting encryption. Arbitrary commotion infusion, irregular projection to assault the bothered insights and inquiries the utilization of the strong recovering assaults, it is under quiet ordering levels. This grants permits to speedup assortment inquiry handling for that include effectively introduce ordering techniques, strategy the kNN inquiries the kNN –R set of tenets is particularly intended for work with a RASP extend address calculations that encourages improve the way of kNN questions.

Key-Words / Index Term

Confidentiality, kNN-R Algorithm, RASP Algorithm, Query Processing

References

[1] ES. Elizabeth, MK. Padmaveni, “Confidential and Efficient Query Services in the Cloud”, IJREAT International Journal of Research in Engineering and Advanced Technology, Vol.2, Issue.1, pp.15-21, 2014.
[2] H. Xu, S. Guo, K. Chen, “Building confidential and efficient query services in the cloud with rasp data perturbation”, IEEE transactions on knowledge and data engineering, Vol.26, No.2, pp.322-335, 2014.
[3] S. Ayyub, D. Roy, "Cloud Computing Characteristics and Security Issues", International Journal of Computer Sciences and Engineering, Vol.1, Issue.4, pp.18-22, 2013.
[4] V.K. Saxena, S. Pushkar, "Privacy Preserving using Encryption Proxy in Data Security", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.2, pp.36-41, 2017.
[5] K. Chen, L. Liu, G. Sun, “Towards Attack-Resilient Geometric Data Perturbation”, Proceedings of the 2007 SIAM International Conference on Data Mining, Minnesota, pp.78-89, 2007.
[6] Vanajakshi Devi, Praveen Kumar, “Confidential and Efficient Hosting Query Services in Public Clouds with RASP Data Disruption”, International Journal of Science and Research (IJSR),Vol.4, Issue.4, pp.3087-3089, 2015.
[7] H. Hu, J. Xu, C. Ren, B. Choi, “Processing private queries over untrusted data cloud through privacy homomorphism”, Proceedings of IEEE International Conference on Data Engineering (ICDE), NY, pp.601-612, 2011.
[8] B. Chor, E. Kushilevitz, O. Goldreich, M. Sudan, “Private information retrieval”, ACM Computer Survey, Vol.45, No. 6, pp. 965-981, 1998.
[9] H. Hu, J. Xu, C. Ren, B. Choi, “Processing private queries over untrusted data cloud through privacy homomorphism”, Proceedings of IEEE International Conference on Data Engineering (ICDE), Germany, pp. 601-612, 2011.