Accession Number : AD0751289

Title :   Combinatorial Information Retrieval Schemes,

Corporate Author : NORTH CAROLINA UNIV CHAPEL HILL DEPT OF STATISTICS

Personal Author(s) : Vijayaditya,N.

Report Date : JUL 1972

Pagination or Media Count : 152

Abstract : The development of an information filing scheme deals not only with the storage of data but also with the retrieval. The efficiency of a filing scheme is measured not only in terms of the ease with which it is possible to retrieve information pertinent to a given task but also in terms of the retrieval time. In this research, combinatorial methods are applied to obtain filing schemes that are efficient in terms of retrieval time. In the begining, a brief review of the relevant basic combinatorial techniques along with applications to the filing schemes is given. Then a few interesting properties, dealing with the intersections of quadrics and flat space are obtained. Later, these results are applied to obtain filing schemes. In multiple-valued attributes is developed. The design of this (representation model) depends on matrices, over a finite field, with a certain property. A method, applying the theory of spreads, for obtaining some of these matrices, is given. Finally, using this representation, a filing scheme for multiple-valued attributes is obtained. (Author)

Descriptors :   (*INFORMATION RETRIEVAL, *COMBINATORIAL ANALYSIS), (*DATA STORAGE SYSTEMS, INFORMATION RETRIEVAL), MATHEMATICAL LOGIC, PROJECTIVE GEOMETRY, EXPERIMENTAL DESIGN, MATRICES(MATHEMATICS), SET THEORY, THEOREMS, THESES

Subject Categories : Information Science
      Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE