File organization schemes based on finite geometries

DOI10.1016/S0019-9958(68)90251-9MaRDI QIDQ5571369zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

computer science and automata

Cited in

(9)

• Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics
• Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. II: Zugriffssysteme
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems
• Partition of a query set into minimal number of subsets having consecutive retrieval property
• Some \(t\)-designs are minimal \((t+1)\)-coverings
• On the theory of the consecutive storage of relevant records
• Partial match retrieval
• Cyclic multiple-valued filing schemes for higher-order queries
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5571369)