Scatter storage techniques
- 1 January 1968
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 11 (1) , 38-44
- https://doi.org/10.1145/362851.362882
Abstract
Summary:In this paper several methods for constructing tables without repetition of items are studied from the probabilstic point of view. Formulae for expected values of the number of examinations of the kind "is $x$ placed in cell $T_i$ in a table $T$?" are given. The situation when a table $T$ is placed on a backing store of a computer and segmented is also considered. Described methods are very useful in many systems of information processing
Keywords
This publication has 4 references indexed in Scilit:
- A variant method of file searchingCommunications of the ACM, 1963
- Analysis of a file addressing methodCommunications of the ACM, 1962
- An indirect chaining method for addressing on secondary keysCommunications of the ACM, 1961
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957