ScholarLens Back to search
2011•Journal of Zhengzhou University of Light IndustryRequires access

Dynamic hashing and its improvement

Yanjun Wang

Open publisher page 0 citations

Abstract

Extensible hashing and linear hashing were discussed,and an improved algorithm for the hashing suffix length inequality was stated,which avoided unnecessary overflow bucket.The number of hash buckets grow linearly,which avoid splitting buckets and updating bucket address table continually,caused by unusual distribution of search key.The experiments of the simulation method showed that the improved algorithm was significantly better than extensible hashing and linear hashing.

About this research paper

What this paper is about

Extensible hashing and linear hashing were discussed,and an improved algorithm for the hashing suffix length inequality was stated,which avoided unnecessary overflow bucket.The number of hash buckets grow linearly,which avoid splitting buckets and updating bucket address table continually,caused by unusual distribution of search key.The experiments of the simulation method showed that the improved algorithm was significantly better than extensible hashing and linear hashing.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Extensible hashing and linear hashing were discussed,and an improved algorithm for the hashing suffix length inequality was stated,which avoided unnecessary overflow bucket.The number of hash buckets grow linearly,which avoid splitting buckets and updating bucket address table continually,caused by unusual distribution of search key.The experiments of the simulation method showed that the improved algorithm was significantly better than extensible hashing and linear hashing.

Key concepts: Dynamic perfect hashing, Linear hashing, Hash table, Hash function, Computer science, Universal hashing, Consistent hashing, Double hashing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Dynamic hashing and its improvement — Research Paper | ScholarLens