Abstract
The chaotic property of a new open addressing hash function, called exponential hashing, is presented. Our analysis indicates the connection between ergodic theory and hashing Based on that, concepts from eigodic theory are applied to predict the performance of exponential hashing. Experimental results are presented to verify our theoretic analysis and the prediction.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2408-2411 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E87-A |
| Issue number | 9 |
| State | Published - Sep 2004 |
| Externally published | Yes |
Keywords
- Chaotic probing
- Double hashing
- Exponential hashing
- Hash function
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics