Cyclic multiple-valued filing schemes for higher-order queries
From MaRDI portal
Multiple-valued filing schemes of arbitrary order are constructed using the cyclic group model developed by Berman. The cyclic schemes presented are valid for a wide range of parameters, including all first-, and second-, and third-order systems. The storage and retrieval algorithms do not require scanning lists of buckets or records.
Recommendations
- The application of coding theory to the design of combinatorial filing schemes of any order
- scientific article; zbMATH DE number 3881908
- On the File Design Problem for Partial Match Retrieval
- Optimal organization of multilevel indexed sequential files
- Optimal MMI file systems for orthogonal range retrieval
Cites work
- Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes
- Combinatorial Information Retrieval Systems for Files
- Combinatorial multiple-valued filing systems for multiattribute queries
- Cyclic multiple-valued filing schemes for higher-order queries
- Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry
- Design of a new balanced file organization scheme with the least redundancy
- File organization schemes based on finite geometries
- New balanced-file organization schemes
- Order-(t − 1) balanced multiple-valued filing scheme using difference vectors
- The application of difference sets to the design of a balanced multiple-valued filing scheme
- The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
This page was built for publication: Cyclic multiple-valued filing schemes for higher-order queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760811)