Extendible hashing is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. Because of the hierarchical nature...

range. In Linear Hashing there are two types of buckets, those that are to be split and those already split. While extendible hashing splits only overflowing...

Bloom filter Consistent hashing Distributed hash table Extendible hashing Hash array mapped trie Lazy deletion Pearson hashing PhotoDNA Rabin–Karp string...

minimal movement property. Extendible hashing uses a dynamic hash function that requires space proportional to n to compute the hash function, and it becomes...

dynamic perfect hashing; cuckoo hashing; hopscotch hashing; and extendible hashing.: 42–69  A simple alternative to perfect hashing, which also allows...

inserting a new key into a cuckoo hashing table may push an older key to a different location in the table. Cuckoo hashing was first described by Rasmus Pagh...

families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer...

In machine learning, feature hashing, also known as the hashing trick (by analogy to the kernel trick), is a fast and space-efficient way of vectorizing...

SQL extended for graph traversal. OrientDB uses several indexing mechanisms based on B-tree and Extendible hashing, the last one is known as "hash index"...

uses hashing techniques to enable fast retrieval of the data by key. The hashing scheme used is a form of extendible hashing, so that the hashing scheme...

of work, for hashing digital signatures and as a key derivation function Polkadot, a multi-chain blockchain uses BLAKE2b as its hashing algorithm. PCI...

computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating...

methods that require a high-quality hash function, including hopscotch hashing, cuckoo hashing, and the MinHash technique for estimating the size of...

this context. In 2013 a Password Hashing Competition was announced to choose a new, standard algorithm for password hashing. On 20 July 2015 the competition...

state expandable hashing expander graph exponential extended binary tree extended Euclidean algorithm extended k-d tree extendible hashing external index...

Spiral hashing, also known as Spiral Storage is an extensible hashing algorithm. As in all hashing schemes, spiral hashing stores records in a varying...

search tries Hash trie Deterministic finite automata Judy array Search algorithm Extendible hashing Hash array mapped trie Prefix hash tree Burstsort...

class include ConcurrentSkipListMap, EnumMap, HashMap, IdentityHashMap, TreeMap and WeakHashMap. EnumMap extends AbstractMap. EnumMap has comparable speed...

the hash function (e.g. 64 bytes for SHA-1) // Keys longer than blockSize are shortened by hashing them if (length(key) > blockSize) then key = hash(key)...

the above picture hash 0 is the result of hashing the concatenation of hash 0-0 and hash 0-1. That is, hash 0 = hash( hash 0-0 + hash 0-1 ) where "+" denotes...

of them using terms differently from RDBMS. Fagin; et al. (2009). "Extendible hashing—a fast access method for dynamic files". ACM Transactions on Database...

Pearson hashing is a non-cryptographic hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any...

a checksum. Hash function security summary Secure Hash Algorithms NIST hash function competition Key derivation functions (category) "Hash functions"....

this attack is to compute the hashes using a key derivation function that adds a "salt" to each password before hashing it, with different passwords receiving...

stream cipher, an authenticated encryption system, a "tree" hashing scheme for faster hashing on certain architectures, and AEAD ciphers Keyak and Ketje...

Skein paper defines optional features such as randomized hashing, parallelizable tree hashing, a stream cipher, personalization, and a key derivation function...

symbol # is known variously in English-speaking regions as the number sign, hash, or pound sign. The symbol has historically been used for a wide range of...

"signs of weakness". It is deprecated in favor of SHA-256 and other strong hashing algorithms. Nevertheless, as of 2014[update], it remained in use in public...

suffixes of words. The suffix tree is a type of trie. Tries support extendible hashing, which is important for search engine indexing. Used for searching...

merkle root hashes for each piece. The new format uses SHA-256 in both the piece-hashing and the infohash, replacing the broken SHA-1 hash. The "btmh"...