Keywords Depth of the First Data in the Greedy Algorithm Coding Nube

Sandhya Rani, T. Rakesh kumar

Abstract


Due to the growing popularity of cloud computing, more and more data owners are willing to outsource their data Cloud great service for the convenience and cost reduction in the field of data management. However, you should encrypt sensitive data before Outsourcing to meet specific needs, which obsoletes the use of data, such as document retrieval by keyword. In this paper, we present Multi-word search safer place cloud encrypted data, which supports the plan revaluations dynamics same time

Such as inserting and deleting documents. Specifically, the combination of vector space model is used in a large scale TF? model FIL Building index and generate query. We build the index structure based on your tree and propose "greed depth I. Search "algorithm is effective to provide a search for multiple words in the place. KNN algorithm is used to encrypt Index safe and consultation Tankers, and at the same time guarantee the accuracy of the result calculated link between the vectors index query and encrypted. In order to resist He added statistical ghost where vectors attacks against the index result is blindness. This is because the use of our private tree based

index structure, the proposed system can achieve sub-time search of sin and deal with the insertion and removal of documents flexibly. And I conducted extensive tests to demonstrate the effectiveness of the proposed plan. 


Full Text:

PDF




Copyright (c) 2016 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org