Skip to search formSkip to main contentSkip to account menu

Dynamic perfect hashing

In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure.While more memory… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Amortized analysisCollision (computer science)Computer scienceData structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Leakage Cell Probe Model: Lower Bounds for Key-Equality Mitigation in Encrypted Multi-Maps
Encrypted multi-maps (EMMs) enable clients to outsource the storage of a multi-map to a potentially untrusted server while… 
Review
2015
Review
2015
A SURVEY OF MATHEMATICAL AND INFORMATIONAL FOUNDATIONS OF THE BIGARM ACCESS METHOD
The BigArM is an access method for storing and accessing Big Data. It is under development. In this survey we present its… 
2012
2012
Routing Table Implementation Using Integer Data Structure
Tremendous growth in traffic is witnessed over the Internet where backbone links of several gigabits per second are commonly… 
2005
2005
Dynamic Perfect Hashing with Finite-State Automata
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with… 
1993
1993
B.3 Dynamic Hashing Figure 6: Rejection Method B.1 Rejection Method
  • 1993
  • Corpus ID: 5390547
Any single hash function chosen can encounter some bad worst-case inputs that cause linear-time rather than constant-time… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)