ScholarLens Back to search
2004•IEICE Electronics ExpressOpen access

Improved exponential hashing

Wenbin Luo, Gregory L. Heileman

Open full text 4 citations

Abstract

A new and efficient open addressing technique, called improved exponential hashing, is proposed. We show that improved exponential hashing has the ability to spread table elements more randomly than the widely used double hashing, and at the same time produces full length probe sequences on all table elements. We demonstrate experimentally that improved exponential hashing performs significantly better than double hashing for clustered data. Also, some theoretic analysis is provided along with the experimental results.

Open-access reader

About this research paper

What this paper is about

A new and efficient open addressing technique, called improved exponential hashing, is proposed. We show that improved exponential hashing has the ability to spread table elements more randomly than the widely used double hashing, and at the same time produces full length probe sequences on all table elements. We demonstrate experimentally that improved exponential hashing performs significantly better than double hashing for clustered data. Also, some theoretic analysis is provided along with the experimental results.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

A new and efficient open addressing technique, called improved exponential hashing, is proposed. We show that improved exponential hashing has the ability to spread table elements more randomly than the widely used double hashing, and at the same time produces full length probe sequences on all table elements. We demonstrate experimentally that improved exponential hashing performs significantly better than double hashing for clustered data. Also, some theoretic analysis is provided along with the experimental results.

Key concepts: Dynamic perfect hashing, Exponential function, Consistent hashing, Linear hashing, Double exponential function, Hash table, Hash function, Universal hashing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved exponential hashing — Research Paper | ScholarLens