On Disk Allocation Methods for Cartesian Product Files by using Error Correcting Codes

Abstract

We have discussed disk allocation methods for Cartesian product files by introducing error correcting codes, and have clarified the performance of the methods by system evaluation models using rate distortion theory. Let us assume qⁿ Cartesian product files with n attributes and store qⁿ files into g (<qⁿ) disks. For a partial match query(access request), we propose new disk allocation methods which are able to access in parallel to the disks as much as possible. Then we show that the proposed methods exhibit good property when n becomes large.