Combinatorial Information Retrieval Systems for Files

DOI10.1137/0116079zbMATH Open0205.19102OpenAlexW2020341089MaRDI QIDQ5604907FDOQ5604907

Authors:

Publication date: 1968

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0116079

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited In (8)

• Partition of a query set into minimal number of subsets having consecutive retrieval property
• Some filing schemes based on finite groups of automorphisms
• Cyclic multiple-valued filing schemes for higher-order queries
• Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics
• Title not available (Why is that?)
• The application of coding theory to the design of combinatorial filing schemes of any order
• Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. II: Zugriffssysteme
• Some \(t\)-designs are minimal \((t+1)\)-coverings

This page was built for publication: Combinatorial Information Retrieval Systems for Files

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