S. Pradeep Kumar Reddy, M. Raghavendra Rao


There is a lot of advancement in the internet based strategy in a well efficient fashion respectively. Here the advancement is related to the computation of the cloud in a well oriented approach respectively. There is a lot of demand for this particular aspect from the user based aspect in a well oriented fashion respectively. Many of the users are getting attracted to this particular strategy in a well efficient fashion respectively. Here there is a user friendly oriented access of the environment followed by the quite reliable fashion respectively. There is a major problem with respect to this particular oriented strategy is the security is the major problem due to the wireless based communication of the data in a well oriented fashion respectively. Here the service provider based on the outsourcing oriented data plays a major role in the system based aspect in which query based similarity measure followed by the data metric oriented outsourcing in a well oriented fashion respectively. Here there is a provision has to be maintained in the present design oriented technique is rather well efficient format in which depending on the requirement of the user the data is directly provided for the user based access but not for the mediator oriented strategy by the dealer. Here there is a huge analysis is made n the system that is the mutual agreement is made between the user followed by the well effective service provider based fashion in which there would be maintained with the privacy or not and also the agreement involves the terms and conditions oriented aspect followed by the terms of the use with respect to the cost and the bandwidth allocation and everything there is a proper trade off followed by the negotiation based phenomena. Experiments have been conducted on the present designed technique and it performance based strategy followed by the entire system outcome is displayed in a very efficient fashion respectively.


Processing of the data related query; Security based aspect; Privacy control; Data authentication and integration respectively;


T. Seidl and H.P. Kriegel, “Optimal Multi-Step k-Nearest Neighbor Search,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 154-165, 1998.

L. Sweeney, “k-Anonymity: A Model for Protecting Privacy,” Int’l J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.

R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order-Preserving Encryption for Numeric Data,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 563-574, 2004.

R. Agrawal and R. Srikant, “Privacy-Preserving Data Mining,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 439- 450, 2000.

C.A. Ardagna, M. Cremonini, E. Damiani, S.D.C. di Vimercati, and P. Samarati, “Location Privacy Protection Through Obfuscation- Based Techniques,” Proc. 21st Ann. IFIPWG11.3 Working Conf. Data and Applications Security (DBSec), pp. 47-60, 2007.

V. Athitsos, M. Potamias, P. Papapetrou, and G. Kollios, “Nearest Neighbor Retrieval Using Distance-Based Hashing,” Proc. IEEE 24th Int’l Conf. Data Eng. (ICDE), pp. 327-336, 2008.

N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*- Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 322-331, 1990.

S. Berchtold, D.A. Keim, and H.-P. Kriegel, “The X-Tree : An Index Structure for High-Dimensional Data,” Proc. 22nd Int’l Conf. Very Large Databases, pp. 28-39, 1996.

T. Bozkaya and Z.M. O¨ zsoyoglu, “Indexing Large Metric Spaces for Similarity Search Queries,” ACM Trans. Database Systems, vol. 24, no. 3, pp. 361-404, 1999.

E. Cha´vez, G. Navarro, R.A. Baeza-Yates, and J.L. Marroquı´n, “Searching in Metric Spaces,” ACM Computing Surveys, vol. 33, no. 3, pp. 273-321, 2001.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2021, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at