Improved exponential hashing

Wenbin Luo; Gregory L. Heileman

doi:10.1587/elex.1.150

Improved exponential hashing

Wenbin Luo, Gregory L. Heileman

Research output: Contribution to journal › Article › peer-review

3 Scopus 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.

Original language	English (US)
Pages (from-to)	150-155
Number of pages	6
Journal	IEICE Electronics Express
Volume	1
Issue number	7
DOIs	https://doi.org/10.1587/elex.1.150
State	Published - Jul 2004
Externally published	Yes

Keywords

double hashing
hash table
open addressing

ASJC Scopus subject areas

Electronic, Optical and Magnetic Materials
Condensed Matter Physics
Electrical and Electronic Engineering

Access to Document

10.1587/elex.1.150

Cite this

@article{8c252eb97f16427b8438925dfebda0c3,

title = "Improved exponential hashing",

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.",

keywords = "double hashing, hash table, open addressing",

author = "Wenbin Luo and Heileman, {Gregory L.}",

year = "2004",

month = jul,

doi = "10.1587/elex.1.150",

language = "English (US)",

volume = "1",

pages = "150--155",

journal = "IEICE Electronics Express",

issn = "1349-2543",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

number = "7",

}

TY - JOUR

T1 - Improved exponential hashing

AU - Luo, Wenbin

AU - Heileman, Gregory L.

PY - 2004/7

Y1 - 2004/7

N2 - 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.

AB - 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.

KW - double hashing

KW - hash table

KW - open addressing

UR - http://www.scopus.com/inward/record.url?scp=32144463269&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32144463269&partnerID=8YFLogxK

U2 - 10.1587/elex.1.150

DO - 10.1587/elex.1.150

M3 - Article

AN - SCOPUS:32144463269

SN - 1349-2543

VL - 1

SP - 150

EP - 155

JO - IEICE Electronics Express

JF - IEICE Electronics Express

IS - 7

ER -

Improved exponential hashing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this