File organization schemes based on finite geometries
From MaRDI portal
Publication:5571369
DOI10.1016/S0019-9958(68)90251-9zbMath0181.19703OpenAlexW1998425621MaRDI QIDQ5571369
No author found.
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(68)90251-9
Related Items (9)
Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics ⋮ Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. II: Zugriffssysteme ⋮ Partial match retrieval ⋮ Information storage and retrieval - mathematical foundations. II: Combinatorial problems ⋮ Partition of a query set into minimal number of subsets having consecutive retrieval property ⋮ Cyclic multiple-valued filing schemes for higher-order queries ⋮ On the theory of the consecutive storage of relevant records ⋮ Some \(t\)-designs are minimal \((t+1)\)-coverings ⋮ The application of coding theory to the design of combinatorial filing schemes of any order
This page was built for publication: File organization schemes based on finite geometries
