Matches in DBpedia 2016-04 for { <http://permabit.wordpress.com/2008/07/18/what-do-hash-collisions-really-mean/> ?p ?o }
Showing triples 1 to 9 of
9
with 100 triples per page.
- what-do-hash-collisions-really-mean accessdate "2011-03-24".
- what-do-hash-collisions-really-mean author "Jered Floyd".
- what-do-hash-collisions-really-mean date "2008-07-18".
- what-do-hash-collisions-really-mean isCitedBy Collision_(computer_science).
- what-do-hash-collisions-really-mean location permabit.wordpress.com.
- what-do-hash-collisions-really-mean publisher "Permabits and Petabytes".
- what-do-hash-collisions-really-mean quote "For the long explanation on cryptographic hashes and hash collisions, I wrote a column a bit back for SNW Online, “What you need to know about cryptographic hashes and enterprise storage”. 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. The trouble is, by a mathematical rule called the “pigeonhole principle”, you can’t uniquely map any possible files or file chunk to a shorter fingerprint. Statistically, there are multiple possible files that have the same hash.".
- what-do-hash-collisions-really-mean title "What do Hash Collisions Really Mean?".
- what-do-hash-collisions-really-mean url what-do-hash-collisions-really-mean.