Skip Navigation

The Computer Journal 1971 14(2):145-149; doi:10.1093/comjnl/14.2.145
© 1971 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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Král, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Some properties of the scatter storage technique with linear probing

J. Král *

Institute for Computation Techniques of the CVUT, Horská 3, Praha, Czechoslovakia

Let M(n, k) be (for a scatter storage technique) the average number of probes necessary to find an item in a table T of length n containing k items. Some identities allowing us to compute M(n, k) for the scatter storage technique with linear probing for various n and k are given. From the behaviour of M(n, k), as asymptotical formula given in Morris (1968) follows. For n greater double equals1,024 and k/n less double equals 0·8 the values of M(n, k) are practically equal to the corresponding asymptotical values. A comparison with some other scatter storage methods is made. It is shown that in may cases the linear probing method is the best one.

Received September 1969.

* Institute for Computation Techniques of the CVUT, Horská, 3, Praha 2, Czechoslovakia


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.