Scribd
Upload
19 views1 page

Hash

A hash function maps data of arbitrary size to fixed-size values called hashes which are used to index a hash table. Hashing provides computationally and storage efficient data access avoiding non-linear access times and exponential storage requirements of other data structures.

Uploaded by

William Ferney Moreno Torres
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views1 page

Hash

A hash function maps data of arbitrary size to fixed-size values called hashes which are used to index a hash table. Hashing provides computationally and storage efficient data access avoiding non-linear access times and exponential storage requirements of other data structures.

Uploaded by

William Ferney Moreno Torres
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

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 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 and 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 which avoids the non-linear
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.

You might also like