LinkedDataHub - Hash function

Hash function

Hash function

A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are usually used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing.

Comment: enA hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are usually used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing.
Date: enJanuary 2021
Depiction
Has abstract: enA hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are usually used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing. Hash functions and their associated hash tables are used in data storage and retrieval applications to access data in a small and nearly constant time per retrieval. They require an amount of storage space only fractionally greater than the total space required for the data or records themselves. Hashing is a computationally and storage space-efficient form of data access that avoids the non-constant access time of ordered and unordered lists and structured trees, and the often exponential storage requirements of direct access of state spaces of large or variable-length keys. Use of hash functions relies on statistical properties of key and function interaction: worst-case behaviour is intolerably bad with a vanishingly small probability, and average-case behaviour can be nearly optimal (minimal collision). Hash functions are related to (and often confused with) checksums, check digits, fingerprints, lossy compression, randomization functions, error-correcting codes, and ciphers. Although the concepts overlap to some extent, each one has its own uses and requirements and is designed and optimized differently. The hash function differs from these concepts mainly in terms of data integrity.
Is primary topic of: Hash function
Label: enHash function
Link from a Wikipage to an external page: tools.timodenk.com/%3Fp=hash-function; www.sinfocol.org/archivos/2009/11/Goulburn06.pdf; dspace5.zcu.cz/bitstream/11025/11784/1/Skala_2010_Corfu-NAUN-Hash.pdf
Link from a Wikipage to another Wikipage: Albert Lindsey Zobrist; ASCII; Associative array; Birthday problem; Bit shifting; Blockchain; Bloom filter; Cache (computing); Category:Hash functions; Category:Search algorithms; Character (computing); Character string; Check digit; Checksums; Chi-squared test; Cipher; Closest pair problem; Compilers: Principles, Techniques, and Tools; Computational geometry; Computer graphics; Coprime integers; Cryptographic hash function; Data (computing); Data integrity; Data structure; Deterministic algorithm; Digraph (computing); Distributed hash table; Donald Knuth; Double hashing; Element (mathematics); Equivalence relation; Error correction code; Extendible hashing; Factorial; Fibonacci number; File:Hash table 4 1 1 0 0 1 0 LL.svg; Fingerprint (computing); Function (mathematics); Garbage collection (computer science); Geometric hashing; Golden ratio; Grid file; Hans Peter Luhn; Hash collision; Hash table; Hash tables; IBM; Identicon; Identity function; Image processing; Image retrieval; ISO 3166-1 alpha-2; ISO Latin 1; Java (programming language); Letter case; Linear hashing; Linear probing; Linked list; List of hash functions; Lossy compression; Low-discrepancy sequence; Mask (computing); Metric space; Modulo operation; Natural language; Nearest neighbor search; Odd number; Partition (mathematics); Pathological (mathematics); Perfect hash function; PJW hash function; Plane (geometry); Portable Document Format; Prime number; Probability; Proximity problem; Pseudorandom number generator; Pseudo-random number generator; Python (programming language); Quadratic probing; Rabin fingerprint; Rabin-Karp; Randomization function; Randomized algorithm; Set (abstract data type); Set (computer science); SipHash; Strict avalanche criterion; String searching algorithm; Substring; Three-dimensional space; Transposition table; Tuple; Unicode; Universal hashing; URL; Word size
Reason: en"a" is a constant, so it cannot be random; enHow large?
SameAs: Avtrykksfunksjon; Fonction de hachage; Fonzion de hash; Função hash; Funció hash; Función hash; Función hash; Funcție hash; Fungsi cincangan; Fungsi hash; Funkcja skrótu; Funzione di hash; Hach-funciono; Hajautusalgoritmi; Haketfunkcio; Hàm băm; Hashfunctie; Hash function; Hash function; Hash funksionet; Hashfunktion; Hashfunktion; Hashfunktion; Hashing; Hasítófüggvény; Hašovacia funkcia; Hašovací funkce; Heš funkcija; Heš funkcija; Heş funksiya; Jaucējfunkcija; Karma işlevi; m.03l5h; Maišos funkcija; mZ4c; Q183427; Räsifunktsioon; Tætifall; Zgoščevalna funkcija; Συνάρτηση κατατεμαχισμού; Араластыру; Раздробувачка функција; Хеш функция; Хеш-функция; Хеш-функція; Хэш функц; Հեշ ֆունկցիա; פונקציית גיבוב; تابع هش; دالة تجزئة; ฟังก์ชันแฮช; ハッシュ関数; 散列函數; 해시 함수
SeeAlso: Linear congruential generator; Universal hashing
Subject: Category:Hash functions; Category:Search algorithms
Thumbnail
WasDerivedFrom: Hash function?oldid=1123870368&ns=0
WikiPageLength: 46071
Wikipage page ID: 13790
Wikipage revision ID: 1123870368
WikiPageUsesTemplate: Template:About; Template:Citation needed; Template:Clarify; Template:Cn; Template:Columns-list; Template:Fix; Template:Main; Template:Math; Template:More citations needed; Template:Redirect; Template:Reflist; Template:See also; Template:Short description; Template:Val; Template:Wiktionary