Hashing

special class of hash function that has certain properties which make it suitable for use in cryptography

tree data structure whose nodes are recursively cryptographically hashed

decentralized distributed system that provides a lookup service similar to a hash table

thumb|upright=1.5|HMAC-SHA1 generation

hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives

string searching algorithm

<!-- see User_talk:Kinema. I User:Bpringlemeir had ask what additional material needs cited here. The entire article is a synopsis of the original paper by Maymounkov and Mazières. If people wish more references, please give a clue as to what in article does not have adequate references on the talk page.

computer science situation where distinct data elements share an identifier (e.g. name, tag, checksum)

hashing technique

hashing data structure with worst-case constant lookup time based on moving old keys to make room for new ones

collision resolution scheme

PhotoDNA is a proprietary image-identification and content filtering technology widely used by online service providers. Although the design of the algorithm has never been publicly disclosed, a leaked software library that implements it became accessible through a repository on GitHub in 2021.

collision resolution scheme

selection of a hash function at random from a family of hash functions with a certain mathematical property, guaranteeing a low number of collisions in expectation, even if the data is chosen by an adversary

method of dimension reduction in which closer items have greater probability of being mapped to the same hash bucket

set of hash functions generate no collisions

algorithm used in relational databases

In computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was published by Andrei Broder in a 1997 conference, and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results. It has also been applied in large-scale clustering problems, such as clustering documents by the similarity of their sets of words.