Skip Navigation

The Computer Journal 1977 20(2):137-140; doi:10.1093/comjnl/20.2.137
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mallach, E. G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Scatter storage techniques: A unifying viewpoint and a method for reducing retrieval times

E. G. Mallach *

123 Fairfield Street, Needham, Massachusetts, USA

A means of viewing the organisation of a scatter storage table (hash table) as a binary tree is presented. This viewpoint leads directly to an algorithm for inserting new entries in such tables, which yields lower expected retrieval times than other comparable methods, especially if the table is nearly full. It is shown how this method subsumes both earlier methods (such as linear quotient) and the improved method proposed by Brent in 1973. Results of Monte Carlo experiments and of a theoretical analysis confirm the benefits of the proposed method.

Received October 1974.

* 123 Fairfield Street, Needham, Massachusetts 02192, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.