A Cuckoo Hashing Scheme for Collision Reduction in Cloud Storage Systems

Article Sidebar

PDF
Published: Aug 8, 2018
DOI: https://doi.org/10.26483/ijarcs.v9i0.6238
Keywords:
Cloud storage, cuckoo hashing, ranking process, data insertion and query.

Main Article Content

Rabia Basri
Sanjay S V, Shilpa Bhasker, Shruthi J and Vani Krishnaswamy

Abstract

Retrieving a specific data from any large scale storage systems have been the most complicated process in the world of technologies. With this high speed growth of the information, cloud servers are required to operate and examine the bulk of high- dimensional and unstructured dataprecisely. Although, cloud computing systems provide services to the large storage devices, it is still challenging to obtain accurate results for query requests in a real-time manner. The cuckoo hashing methods have been used widely because of its simple flow and ease of work. But, due to the collisions between the data, the cuckoo hashing scheme suffers from endless loops and high insertion latency. In order to serve these problems, we present an efficient cuckoo hashing scheme called Mincounter. The purpose behind the Mincounter is to reduce the occurrence of endless loops during data insertion. The scheme has the main features of offering efficient insertion and query services and delivering high performance of cloud servers, as well as extending the services of cloud computing servers. The Mincounter is implemented in a large scale database in the real world. The results represent the efficiency of Mincounter scheme.

Downloads

Download data is not yet available.

Article Details

Issue
2018: Volume 9 Special Issue No. 3, May 2018
Section
Articles

COPYRIGHT

Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
  • The journal allows the author(s) to retain publishing rights without restrictions.
  • The journal allows the author(s) to hold the copyright without restrictions.

References

N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,†Proc. TPDS, vol. 25, no. 1, pp. 222– 233, 2014. [2] Q. Liu, C. C. Tan, J.Wu, and G.Wang, “Efficient information retrieval for ranked queries in cost- effective cloud environments,†Proc. INFOCOM, pp. 2581– 2585, 2 [3] R. P. Brent, “Reducing the retrieval time of scatter storage techniques,†Communications of the ACM, vol. 16, no. 2, pp. 105–109, 1973 [4] S. Wu, F. Li, S. Mehrotra, and B. C. Ooi, “Query optimization for massively parallel data processing,†Proc. SOCC, 2011. [5]Q. Li, Y. Hua, W. He, D. Feng, Z. Nie, Y. Sun,"Necklace: An efficient cuckoo hashing scheme for cloud storage services" [6]Y. Sun, Y. Hua, D. Feng, L. Yang, P. Zuo, S. Cao, "MinCounter: An efficient cuckoo hashing scheme for cloud storage systems.