Disk allocation methods for Cartesian product files by using error-correcting codes

Allocation methods for Cartesian product files on multiple disks using linear error-correcting codes are proposed. This allocation methods can be applied to queries in which the characteristic of each attribute is not uniform. The structure of Reed-Solomon codes over GF(p ^m), which give the strictly optimal allocation when all possible partial match queries are equiprobable, and the mapping by the basis for GF(p^m) over the subfields is used. As a result, it is shown that a file is constructed by records which has the attributes in which the domain is partitioned by different number. The properties of this method are described