| Title | Odd-Even Hash Algorithm: A Improvement of Cuckoo Hash Algorithm |
| Publication Type | Conference Paper |
| Year of Publication | 2022 |
| Authors | Zhu, Haiting, Wan, Junmei, Li, Nan, Deng, Yingying, He, Gaofeng, Guo, Jing, Zhang, Lu |
| Conference Name | 2021 Ninth International Conference on Advanced Cloud and Big Data (CBD) |
| Keywords | Big Data, compositionality, cuckoo hashing, data structures, filtering algorithms, hash algorithms, hash collision, Internet, Memory management, Monitoring, Odd-Even Hash, pubcrawl, Rehashing, resilience, Resiliency, security |
| Abstract | Hash-based data structures and algorithms are currently flourishing on the Internet. It is an effective way to store large amounts of information, especially for applications related to measurement, monitoring and security. At present, there are many hash table algorithms such as: Cuckoo Hash, Peacock Hash, Double Hash, Link Hash and D-left Hash algorithm. However, there are still some problems in these hash table algorithms, such as excessive memory space, long insertion and query operations, and insertion failures caused by infinite loops that require rehashing. This paper improves the kick-out mechanism of the Cuckoo Hash algorithm, and proposes a new hash table structure- Odd-Even Hash (OE Hash) algorithm. The experimental results show that OE Hash algorithm is more efficient than the existing Link Hash algorithm, Linear Hash algorithm, Cuckoo Hash algorithm, etc. OE Hash algorithm takes into account the performance of both query time and insertion time while occupying the least space, and there is no insertion failure that leads to rehashing, which is suitable for massive data storage. |
| DOI | 10.1109/CBD54617.2021.00010 |
| Citation Key | zhu_odd-even_2022 |
Odd-Even Hash Algorithm: A Improvement of Cuckoo Hash Algorithm