What question did this study set out to answer?

This research aims to develop a more efficient hash coding method for data storage and collision resolution.

January 1, 1983Communications of the ACMOpen Access

An improved hash code for scatter storage

View Full Paper

Ask AI

Bookmark

Authors

New hash coding technique enhances storage and collision management in data structures, suggesting efficiency improvements.

This research aims to develop a more efficient hash coding method for data storage and collision resolution.
Introduced a hash coding method using fixed-point division instead of multiplication or logical operations.
Proposed a quadratic search method for managing collisions, which is faster than random search.
Allowed for hash tables of variable lengths.
The new hash coding method significantly reduces computation time compared to traditional methods.
Quadratic search decreases collision clustering, improving search efficiency in hash tables.

Ward Douglas Maurer (1983) studied this question.

View Full Paper

Ask AI

Bookmark