Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics

DOI10.1016/0020-0255(92)90079-NzbMath0800.68394OpenAlexW2017446568MaRDI QIDQ1193847

Lois Wright Hawkes

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90079-n

zbMATH Keywords

information retrievalredundancybucketscombinatorial filing scheme

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contribution to the theory of data base relations
• On minimum matrix representation of closure operations
• Order-(t − 1) balanced multiple-valued filing scheme using difference vectors
• Partial-Match Retrieval Algorithms
• The application of difference sets to the design of a balanced multiple-valued filing scheme
• Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes
• File organization schemes based on finite geometries
• A class of covers for finite projective geometries which are related to the design of combinatorial filing systems
• The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
• Combinatorial Information Retrieval Systems for Files
• Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry
• On the number of unique subgraphs of a graph

This page was built for publication: Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics