Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est hash collision - définition
Hash collision
COMPUTER SCIENCE SITUATION WHERE TWO DATA ELEMENTS SHARE A HASHTAG, CHECKSUM, FINGERPRINT, ETC.
Hash collisions; Hash collision (computer science); Cryptographic hash collision
In computer science, a hash collision or clash is when two pieces of data in a hash table share the same hash value. The hash value in this case is derived from a hash function which takes a data input and returns a fixed length of bits.
hash collision
COMPUTER SCIENCE SITUATION WHERE TWO DATA ELEMENTS SHARE A HASHTAG, CHECKSUM, FINGERPRINT, ETC.
Hash collisions; Hash collision (computer science); Cryptographic hash collision
<programming> (Or "hash clash") When two different keys hash
to the same value, i.e. to the same location in a {hash
table}.
ESR once asked a friend what he expected Berkeley to be
like. The friend replied, "Well, I have this mental picture
of naked women throwing Molotov cocktails, but I think that's
just a collision in my hash tables."
[Jargon File ]
(1995-01-23)
hash table
![This graph compares the average number of CPU cache misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and linear probing. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.](https://commons.wikimedia.org/wiki/Special:FilePath/Hash table average insertion time.png?width=200 "This graph compares the average number of CPU cache misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and linear probing. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.")
ASSOCIATES DATA VALUES WITH KEY VALUES - A LOOKUP TABLE
Hashtable; Hash-table; Hash tables; Hash map; Rehash; Hashmap; Open hashing; Scatter storage; Address-calculation sort; Hash Table; Chaining hash table; Separate chaining; Direct chaining; Collision resolution scheme; External chaining; Load factor (computer science); Hash-Based Indexes; Hash table collisions; Hash table collision; Array hash table; Dynamic-sized hash table; Collision resolution in hash tables
