Live briefing
Everything about Concurrent hash table
Multithreaded to allow concurrent access
A concurrent hash table or concurrent hash map is an implementation of hash tables allowing concurrent access by multiple threads using a hash function. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Concurrent hash tableA 5-minute orientation
- Pick up a classic book: Database system conceptsThe most-reprinted book on the subject
- Read the landmark paper: Concurrent Hash TablesCited 29 times
- Go sideways: Hash array mapped trieA closely related topic
- Go sideways: CtrieA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Concurrent Hash Tables
Scalable concurrent hash tables via relativistic programming
A Lock-Free Hash Trie Design for Concurrent Tabled Logic Programs
Concurrent hash tables on multicore machines: Comparison, evaluation and implications
Concurrent hash tables
Have Your Cake and Eat it (Too): A Concurrent Hash Table with Hardware Transactions
Comparing the performance of concurrent hash tables implemented in Haskell
Concurrent Hash Table Optimized for NUMA System
📚 Books worth reading
Database system conceptsAbraham Silberschatz · 1997
Real World HaskellBryan O'Sullivan, John Goerzen · 2008
OCR AS and A Level Computer ScienceP.M. Heathcote, R S U Heathcote · 2016
Database SystemsRamez Elmasri, Shamkant B. Navathe · 2010- 📕Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed ComputingMass.) ACM Symposium on Principles of Distributed Computing (22nd 2003 Boston · 2003
Operating SystemsWilliam Stallings · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hash array mapped trie A hash array mapped trie (HAMT, /ˈhæmt/) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped…
- Ctrie A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent…
- Java ConcurrentMap The Java programming language's Java Collections Framework version 1.5 and later defines and implements the original regular single-threaded maps, and…
- Threading Building Blocks oneAPI Threading Building Blocks (oneTBB; formerly Threading Building Blocks or TBB) is a C++ template library developed by Intel for parallel programming…
- 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…
- Associative array In computer science, an associative array, key-value store, map, symbol table, or dictionary is an abstract data type that stores a collection of key/value…
- Flyweight pattern In computer programming, the flyweight software design pattern refers to an object that minimizes memory usage by sharing some of its data with other similar…
- 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…