HASHING
- Hashing is a technique used for storing and retrieving keys in a rapid manner.
- In hashing, a string of characters are transformed into a usually shorter length value or key that represents the original string.
- Hashing is used to index and retrieve items in a database because it is faster to find item using shorter hashed key than to find it using the original value.
- Hashing can also be defined as a concept of distributing keys in an array called a hash table using a predetermined function called hash function.
- Hashing is a technique used for storing and retrieving keys in a rapid manner.
- In hashing, a string of characters are transformed into a usually shorter length value or key that represents the original string.
- Hashing is used to index and retrieve items in a database because it is faster to find item using shorter hashed key than to find it using the original value.
- Hashing can also be defined as a concept of distributing keys in an array called a hash table using a predetermined function called hash function.
HASH TABLES
- Hash table is a table (array) where we store the original string. Index of the table is the hashed key while the value is the original string.
- The size of hash table is usually several orders of magnitude lower than the total number of possible string, so several string might have a same hashed-key.
Comments
Post a Comment