A concurrent hash table or concurrent hash map is an implementation of hash tables allowing concurrent access by multiple threads using a hash function...

data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots...

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

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

addressing. It is also well suited for implementing a concurrent hash table. Hopscotch hashing was introduced by Maurice Herlihy, Nir Shavit and Moran...

A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and...

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

provides hash table functionality on an Internet-like scale. CAN was one of the original four distributed hash table proposals, introduced concurrently with...

In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys...

indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers. Data structures provide a means to manage large...

the java.util.concurrent.ConcurrentHashMap implements java.util.concurrent.ConcurrentMap. The mechanism is a hash access to a hash table with lists of...

of an array. HashMap uses a hash table. The hashes of the keys are used to find the elements in various buckets. The HashMap is a hash-based collection...

Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin...

Mainline DHT is the name given to the Kademlia-based distributed hash table (DHT) used by BitTorrent clients to find peers via the BitTorrent protocol...

layout in the tables that are parts of the cluster. A cluster can be keyed with a B-tree index or a hash table. The data block where the table record is stored...

implemented using copy-on-write techniques. The usual concurrent map implementation in Java, ConcurrentHashMap, is not persistent, however. Fully persistent...

operation. Hash tables are commonly said to have expected O(1) insertion and deletion times, but this is only true when considering computation of the hash of...

concurrent updates, and adds support for associating a variable-sized counter to each element. The quotient filter is based on a kind of hash table in...

BitTorrent client introduced distributed tracking using distributed hash tables which allowed clients to exchange data on swarms directly without the...

weak tracking features. For instance, weak hash tables are useful. Like a regular hash table, a weak hash table maintains an association between pairs of...

has not been deleted from the list High Performance Dynamic Lock-Free Hash Tables and List-Based Sets, Maged M. Michael Fomitchev, Mikhail; Ruppert, Eric...

threads concurrently read and update elements that are linked through pointers and that belong to shared data structures (e.g., linked lists, trees, hash tables)...

administrator Data scientist Data structure Data type Associative array and Hash table Array List Tree String Matrix (computer science) Database Imperative...

circular queue clique clique problem clustering (see hash table) clustering free coalesced hashing coarsening cocktail shaker sort codeword coding tree...

a hash table with thread-safe insert and delete operations. Now suppose that we want to delete one item A from table t1, and insert it into table t2;...

example, in class HASH_TABLE [G, KEY -> HASHABLE] a derivation HASH_TABLE [INTEGER, STRING] is valid only if STRING inherits from HASHABLE (as it indeed does...

In concurrent programming, concurrent accesses to shared resources can lead to unexpected or erroneous behavior. Thus, the parts of the program where the...

share the same hash table. The 52-bit address is hashed, then used as an index into the off-chip table. There, a group of eight-page table entries is scanned...

indirection table indexed by the last bits of the result provided by a hash function, taking as inputs the header fields of the packets. The hash function...

created a new database, unencumbered by any AT&T patents: an on-disk hash table that outperformed the existing dbm libraries. Berkeley DB itself was first...