A SHORT NOTE ON SANS.

In the SANS [1, 2] system, which attempts to reduce alphabetical and numerical files to a single file, problems of overflow occur when new members fall between two existing members with consecutive numbers. A method is given for determining the probability distributions of overflows in a cell of size 2^k, and the mean value and variance of these distributions as functions of the growth of the system. In this paper we use some of the results of another paper on a related problem [4] to formulate the problem and obtain a solution. The mathematical treatment outlined can be extended to the calculation of other important parameters, including the expected number of entries which will be out-of-order within a group of areas, and the probability that the last overflow area will itself have an overflow. [ABSTRACT FROM AUTHOR]