BibTeX:

@article{IJIRSTV3I1120,
     title={Storage Based Time Efficient Data Retrieval in Cloud},
     author={S NIRMALRAJ},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={3},
     number={1},
     pages={249--256},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV3I1120.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

To protect outsourced information in cloud storage against corruptions, adding fault tolerance along with information integrity checking and failure reparation becomes critical. Recently, regenerating codes have gained familiarity because of their lower repair information measure whereas providing fault tolerance. This paper implements Data privacy by randomizing the encode coefficients with a pseudorandom function with public auditing and proxy regeneration method which reduces data owner online burden for data integrity checking and reparation respectively. We analyzed that the existing storage scheme requires more time for retrieving repaired data. This paper proposes a naive storage based technique which replaces the merged storage of split files at different servers into individual split file storage (such as A, B, C instead of AB, BC, CA). Thus this paper provides performance analysis of reduced time complexity during retrieval of large collection of long time archival data for future usage.

Cloud Storage, Regenerating Codes, Public Auditing, Proxy, Third Party Auditing, Data Retrieval