IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i6idhcseit172618.html

An Efficient Storage and Retrieval Method Based On Multi-Key Ranked Search & Improved Hierarchical Clustering Index for Cloud Data

Author

Listed:
  • Ajeet Mishra
  • Umesh Kumar Lilhore
  • Nitesh Gupta

Abstract

In this current scenario, computer technologies are getting change day by day. The cost of computing resources are extremely high and it is quite difficult to upgrade hardware’s software. Now users are demanding more innovative technologies which can provide optimum utilization of computing resources and cloud computing is one of them. Cloud computing in an improved form of various existing technologies such as grid computing, cluster computing, and distributed computing. Cloud computing serves computing resources such as PaaS, IaaS, and SaaS to cloud users on demand and ‘pay peruses’ based. A cloud user can store their private and essential data over the cloud and can retrieve any time. Day by day the number of cloud users and the size of cloud data are getting increases. Cloud service providers have to ensure the data privacy and integrity as well availability of stored data. Various cloud researchers are working on cloud data security and efficient retrieval. In this work, we are presenting an efficient data storage and retrieval method for encrypted data based on multi-keyword ranked search by improved hierarchical clustering index for cloud data to improve cloud performance. The proposed method basically takes place in two phases. In first phase IAES-256 bit data encryption and decryption methods are used to maintain data security and SHA-1 method is used to calculate the hash values of the message to maintain the data integrity and second phase uses efficient data retrieval method based on multi-keyword ranked search by improved hierarchical clustering index (by dynamic K-mean) with bagging approach for cloud data. Bagging provides a predictive probabilistic model which reduces the noise and irrelevant data during classification, which improves the accuracy. The proposed method uses an “In order” to verify the authenticity of search results, a structure called minimum hash sub-tree. Proposed method (MRSE-IHCI With bootstrap) and existing method (MRSE-HCI) both are implemented and compared based on various performance measuring parameters such as encryption time and storage, retrieval time and search time. Experimental result analysis clearly shows that proposed method performs outstanding over existing data storage and retrieval method for cloud data.

Suggested Citation

  • Ajeet Mishra & Umesh Kumar Lilhore & Nitesh Gupta, 2017. "An Efficient Storage and Retrieval Method Based On Multi-Key Ranked Search & Improved Hierarchical Clustering Index for Cloud Data," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(6), pages 42-49, December.
  • Handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit172618
    Note: Article URL: https://ijsrcseit.com/CSEIT172618
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT172618
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT172618.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit172618. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.