Combinatorial Information Retrieval Systems for Files

This paper develops a theory of combinatorial information retrieval systems for file organization. Geometric and algebraic methods are employed to construct some combinatorial configurations. These configurations are used for constructing combinatorial filing systems—for files with n binary-valued attributes. These systems use some redundancy in storage and allow for efficient retrieval of records relevant to a query involving t or fewer attributes $(t < n)$.