Some very effective methods of searching in tables
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 placed in cell in a table ?” are given. The situation when a table 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.