| Autor: |
Sridevi G. M., Ashoka D. V., Ramakrishna M. V. |
| Předmět: |
|
| Zdroj: |
International Journal on Information Technologies & Security; 2021, Vol. 13 Issue 1, p51-66, 16p |
| Abstrakt: |
Extendible hashing is one of the earliest Dynamic Hashing schemes proposed to handle operations on files that are dynamic in nature. Much research has been published on the scheme during the last four decades. All of them still require the table size to start with a power of 2 and requires the hash function to yield a sequence of bits for each key. In this paper, we show how these two constraints can be overcome with the use of Universal class of hashing functions which simplifies the design complexity. Experimental results showed reduced table split and merge operations thereby reducing the index maintenance cost. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
