||SQL Server Tips by Gama and Naughter
A hash is a function or algorithm, which takes a blob of data of an
arbitrary length and produces a fixed length hash value. Many
functions can take an arbitrary length of data and return a fixed
length value but what distinguishes a Hash Function is that
Given the data, it is easy to calculate the hash value.
Given the hash value, it is difficult to calculate the message from
which the hash value was calculated. This is why a Hash is also
known as a one-way function.
Given a certain blob of data, which generates a specific hash value,
it is difficult to find another blob that generates the same hash
Sometimes in certain applications, another feature of hashing is
required. This is called ‘collision – resistance’ and means that it
is hard to find two random blobs that generate the same hash.
Each hash implemented in this chapter uses the syntax
The above book excerpt is from:
Turbocharge Database Performance with C++ External Procedures
Joseph Gama, P. J. Naughter