1What is hash collision?
Answer:
In computer science, a collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest
2.What really happens during a hash collision?including image
Answer:
When considering deduplication technologies, other vendors and some analysts bring up the bogeyman of hash collisions.
. The short version is that deduplicating systems that use cryptographic hashes use those hashes to generate shorter “fingerprints” to uniquely identify each piece of data, and determine if that data already exists in the system.
3.What are the ways and methods to resolve hash collision? Explain Each
Open addressing: The simplest way to resolve a collision is to start with the hash address and do a sequential search through the table for an empty location. The idea is to place the record in the next available position in the array. This method is called linear probing. An empty record is indicated by a special value called null. The major drawback of the linear probe method is clustering.
Chaining: In this technique, instead of hashing function value as location we use it as
an index into an array of pointers. Each pointer access a chain that holds the element
having same location.
Walang komento:
Mag-post ng isang Komento