DOI QR코드

DOI QR Code

A Multi-Indexes Based Technique for Resolving Collision in a Hash Table

  • 투고 : 2021.09.05
  • 발행 : 2021.09.30

초록

The rapid development of various applications in networking system, business, medical, education, and other domains that use basic data access operations such as insert, edit, delete and search makes data structure venerable and crucial in providing an efficient method for day to day operations of those numerous applications. One of the major problems of those applications is achieving constant time to search a key from a collection. A number of different methods which attempt to achieve that have been discovered by researchers over the years with different performance behaviors. This work evaluated these methods, and found out that almost all the existing methods have non-constant time for adding and searching a key. In this work, we designed a multi-indexes hashing algorithm that handles a collision in a hash table T efficiently and achieved constant time O(1) for searching and adding a key. Our method employed two-level of hashing which uses pattern extraction h1(key) and h2(key). The second hash function h2(key) is use for handling collision in T. Here, we eliminated the wasted slots in the search space T which is another problem associated with the existing methods.

키워드

참고문헌

  1. Brad Miller, David Ranum. Problem Solving with Algorithms and Data Structures (September 2013)
  2. Michael T. Goodrich, Roberto Tamassia and David M. Mount. Data Structures and Algorithms in C++ (Second Edition) 2009
  3. Rance D. Necaise. Data Structures and Algorithms Using Python. 2011
  4. Narasimha Karumanchi. Data Structures And Algorithms Made Easy 2017
  5. Hans Peter Luhn. 1953. A new method of recording and searching information. American Documentation 4, 1 (1953), 14-16 https://doi.org/10.1002/asi.5090040104
  6. Paul E. Black, "coalesced chaining", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed 09-06-2021) Available from: https://www.nist.gov/dads/HTML/coalescedChaining.html
  7. Pagh, Rasmus and Flemming Friche (2004). Cuckoo hashing. "Journal of Algorithms"
  8. Jane Rubel A. Jeyaraj, Sundarakantham Kambaraj and Velmurugan Dharmarajan (2018). High-speed data deduplication using Parallelized Cuckoo Hashing. "Turkish Journal of Electrical Engineering & Computer Sciences".
  9. B. K. Debnath, S. Sengupta, and J. Li (2010). "Chunkstash: Speeding up inline storage deduplication using flash memory". Proc. USENIX Annual Technical Conference.
  10. A. Kirsch and M. Mitzenmacher, "The power of one move: Hashing schemes for hardware" IEEE/ACM Transactions on Networking, vol. 18, no. 6, pp. 1752?1765, 2010. https://doi.org/10.1109/TNET.2010.2047868
  11. Y. Hua, B. Xiao, and X. Liu (2013) "Nest: Locality-aware approximate query service for cloud computing" Proceedings of the 32nd IEEE International Conference on Computer Communications(INFOCOM), pp. 1327-1335.
  12. Dhar, S., Pandey, K., Premalatha, M., and Suganya, G. (2017). A tree based approach to improve traditional collision avoidance mechanisms of hashing. 2017 International Conference on Inventive Computing and Informatics (ICICI). doi:10.1109/icici.2017.8365368
  13. Arvind K. Sharma ; S.K. Mittal (2019). Cryptography & Network Security Hash Function Applications, Attacks and Advances: A Review. 2019 Third International Conference on Inventive Systems and Control (ICISC).
  14. Knuth, Donald E. (2000). Sorting and searching (2. ed., 6. printing, newly updated and rev. ed.). Boston [u.a.]: Addison-Wesley. p. 514. ISBN 978-0-201-89685- 5.
  15. Weiss, Mark Allen (2009). Data Structures and Algorithm Analysis in C++. Pearson Education. ISBN 978-81-317-1474-4.
  16. Phillip G.Bradford and Michael N. Katehakis (April 2007), "A Probabilistic Study on Combinatorial Expanders and Hashing", SIAM Journal on Computing, 37 (1): 83-111, doi:10.1137/S009753970444630X
  17. Xuewen Wang, Xiaoqing Ding and Changsong Liu (2001). "Character extraction and recognition in natural scene images", Sixth International Conference on Document Analysis and Recognition.