论文信息 - Design of a New Balanced File Organization Scheme With the Least Redundancy

Design of a New Balanced File Organization Scheme With the Least Redundancy

A new balanced file organization scheme of order two for binary-valued records is given which we call HUBFS 2 (Hiroshima University balanced file organization scheme). It can be constructed for a wide range of parameters as is in NBFS 2 . Moreover, it has the least redundancy among the file organization schemes of order two under a general class of probability distribution of records having the invariance property in permutation of attributes. Our scheme is superior to the corresponding NBFS 2 due to Chow as well as BFS 2 due to Abraham, Ghosh, and Ray-Chaudhuri so far as the redundancy is concerned.

[1] N. Hamada,et al. On claw-decomposition of complete graphs and complete bigraphs , 1975 .

[2] R. C. Rose,et al. The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes , 1969 .

[3] Sumiyasu Yamamoto,et al. Design of a Balanced Multiple-Valued Filing Scheme of Order Two Based on Cyclically Generated Spread in Finite Projective Geometry , 1972, Inf. Control..

[4] Sakti P. Ghosh,et al. File Organization Schemes Based on Finite Geometries , 1968, Inf. Control..

[5] D. Ray-Chaudhuri. Combinatorial Information Retrieval Systems for Files , 1968 .

[6] David K. Chow. New Balanced-File Organization Schemes , 1969, Inf. Control..

[7] S. P. Ghosh,et al. Application of finite geometry in file organization for records with multiple-valued attributes , 1968 .

[8] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.