TY - GEN
T1 - System evaluation of disk allocation methods for Cartesian product files by using error correcting codes
AU - Hirasawa, Shigeichi
AU - Saito, Tomohiko
AU - Inazumi, Hiroshige
AU - Matsushima, Toshiyasu
PY - 2011/12/23
Y1 - 2011/12/23
N2 - We discuss disk allocation methods for Cartesian product files by introducing error correcting codes, and have clarified the performance of the methods by system evaluation models developed by using rate distortion theory. Let us assume q n Cartesian product files with n attributes and q actual values in each attribute, and store q n files into G(≤ q n) disks. For a partial match access request, we represent new disk allocation methods which able to access the disks in parallel as much as possible, where the partial match access request includes an indefinite case (don't care: "*") in some attributes and the * requires to access the files with corresponding to the attribute for the all actual attribute values. In this paper, we propose to apply unequal error protection codes to the case where the probabilities of occurrence of the * in the attributes for a partial match access request are not the same. We show the disk allocation methods have desirable properties as n becomes large.
AB - We discuss disk allocation methods for Cartesian product files by introducing error correcting codes, and have clarified the performance of the methods by system evaluation models developed by using rate distortion theory. Let us assume q n Cartesian product files with n attributes and q actual values in each attribute, and store q n files into G(≤ q n) disks. For a partial match access request, we represent new disk allocation methods which able to access the disks in parallel as much as possible, where the partial match access request includes an indefinite case (don't care: "*") in some attributes and the * requires to access the files with corresponding to the attribute for the all actual attribute values. In this paper, we propose to apply unequal error protection codes to the case where the probabilities of occurrence of the * in the attributes for a partial match access request are not the same. We show the disk allocation methods have desirable properties as n becomes large.
KW - Cartesian product files
KW - Chernoff bound
KW - disk allocation
KW - elastic
KW - error correcting codes
KW - flexible
KW - rate distortion theory
KW - system evaluation model
KW - unequal error protection codes
UR - http://www.scopus.com/inward/record.url?scp=83755229323&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=83755229323&partnerID=8YFLogxK
U2 - 10.1109/ICSMC.2011.6084044
DO - 10.1109/ICSMC.2011.6084044
M3 - Conference contribution
AN - SCOPUS:83755229323
SN - 9781457706523
T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
SP - 2443
EP - 2448
BT - 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest
T2 - 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011
Y2 - 9 October 2011 through 12 October 2011
ER -