static hashing
Static hashing is a method of hashing, or shortening a string of characters in computer programming, in which the set of shortened characters remains the same length to improve the ease with which data can be accessed. All objects listed in an object dictionary are static and may not change when static hashing is applied. This method is often compared to the alternative, dynamic hashing.
The process of static hashing creates a smaller, adaptable string of characters, making it faster and easier for users to find objects in a dictionary or groups of objects stored in a containing data structure. Static hashing helps to better utilize the available space in a database for objects, tables and other data within a system.
Uses of static hashing
A hash function is similar to a find and replace feature. Programmers are able to specify a specific item and create a system of rules that change it wherever that item occurs and the specified criteria are met.
When strings of data are accessed, a computer can perform one or more of the following operations:
- Insert- This inserts a new record into the hash table. An address for that record will be generated based on the hash key.
- Delete- This operation first retrieves the record that needs to be deleted and will remove that record address from memory.
- Update- The hash function first locates the record and then updates the record with new data.
- Query- Also known as search, this uses the hash function to pull up records with specified criteria.
Static hashing makes it easier for a large database to call up a specific piece of information and perform various actions on it.
Join the conversation
1 comment