Live briefing
Everything about Dynamic perfect hashing
Programming technique for resolving duplicate hash values in a hash table data structure
In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table counterparts, this technique is useful for situations where fast queries, insertions, and deletions must be made on a large set of elements. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Dynamic perfect hashingA 5-minute orientation
- Pick up a classic book: TCP/IP IllustratedThe most-reprinted book on the subject
- Read the landmark paper: Dynamic Perfect Hashing: Upper and Lower BoundsCited 201 times
- Go sideways: Perfect hash functionA closely related topic
- Go sideways: Hash tableA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
Information and Communications SecurityTat Wing Chim · 2012
Data structures using C and C++Yedidyah Langsam · 2000
Data structures using Cand C[plus plus]Yedidyah Langsam · 1996
Algorithms and data structuresKurt Mehlhorn · 2008- 📕Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed ComputingMass.) ACM Symposium on Principles of Distributed Computing (22nd 2003 Boston · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Perfect hash function In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions…
- Hash table In computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array…
- Coalesced hashing Coalesced hashing, also called coalesced chaining, is a strategy of collision resolution in a hash table that forms a hybrid of separate chaining and open…
- Cuckoo hashing Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup…
- Van Emde Boas tree A van Emde Boas tree (Dutch pronunciation: [vɑn ˈɛmdə ˈboːɑs]), also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which…
- Linear probing Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs…
- Counting Bloom filter A counting Bloom filter (CBF) or spectral Bloom filter is a probabilistic data structure that is used to test whether the number of occurrences of a given…
- Open addressing Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching…