Disk allocation methods for Cartesian product files using unequal error protection codes

Tomohiko Saito; Hiroshige Inazumi; Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1109/ICSMC.2011.6084043

Disk allocation methods for Cartesian product files using unequal error protection codes

Tomohiko Saito^*, Hiroshige Inazumi, Toshiyasu Matsushima, Shigeichi Hirasawa

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Allocation methods for Cartesian product files on multiple disks using linear error-correcting codes are discussed. In this paper, we propose an allocation method using unequal error protection (UEP) codes. Codewords of an UEP code have some special bits which are protected against a greater number of errors than the other bits. We firstly assume a model that "*", which means "don't care", appears with different probability in each attribute of queries. In this case, the average access time can be calculated using the split distance distribution. Finally, we illustrate the average access time of the methods using UEP codes.

Original language	English
Title of host publication	2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest
Pages	2437-2442
Number of pages	6
DOIs	https://doi.org/10.1109/ICSMC.2011.6084043
Publication status	Published - 2011 Dec 23
Event	2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Anchorage, AK, United States Duration: 2011 Oct 9 → 2011 Oct 12

Publication series

Name	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
ISSN (Print)	1062-922X

Other

Other	2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011
Country/Territory	United States
City	Anchorage, AK
Period	11/10/9 → 11/10/12

Keywords

Cartesian product file
error-correcting codes
file allocation
partial match query
unequal error protection codes

ASJC Scopus subject areas

Electrical and Electronic Engineering
Control and Systems Engineering
Human-Computer Interaction

Access to Document

10.1109/ICSMC.2011.6084043

Cite this

Saito, T., Inazumi, H., Matsushima, T., & Hirasawa, S. (2011). Disk allocation methods for Cartesian product files using unequal error protection codes. In 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest (pp. 2437-2442). Article 6084043 (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). https://doi.org/10.1109/ICSMC.2011.6084043

Disk allocation methods for Cartesian product files using unequal error protection codes. / Saito, Tomohiko; Inazumi, Hiroshige; Matsushima, Toshiyasu et al.
2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest. 2011. p. 2437-2442 6084043 (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Saito, T, Inazumi, H, Matsushima, T & Hirasawa, S 2011, Disk allocation methods for Cartesian product files using unequal error protection codes. in 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest., 6084043, Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, pp. 2437-2442, 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011, Anchorage, AK, United States, 11/10/9. https://doi.org/10.1109/ICSMC.2011.6084043

Saito T, Inazumi H, Matsushima T, Hirasawa S. Disk allocation methods for Cartesian product files using unequal error protection codes. In 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest. 2011. p. 2437-2442. 6084043. (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). doi: 10.1109/ICSMC.2011.6084043

@inproceedings{2ffdbdda014d4011878d37cdbd501a8a,

title = "Disk allocation methods for Cartesian product files using unequal error protection codes",

abstract = "Allocation methods for Cartesian product files on multiple disks using linear error-correcting codes are discussed. In this paper, we propose an allocation method using unequal error protection (UEP) codes. Codewords of an UEP code have some special bits which are protected against a greater number of errors than the other bits. We firstly assume a model that {"}*{"}, which means {"}don't care{"}, appears with different probability in each attribute of queries. In this case, the average access time can be calculated using the split distance distribution. Finally, we illustrate the average access time of the methods using UEP codes.",

keywords = "Cartesian product file, error-correcting codes, file allocation, partial match query, unequal error protection codes",

author = "Tomohiko Saito and Hiroshige Inazumi and Toshiyasu Matsushima and Shigeichi Hirasawa",

year = "2011",

month = dec,

day = "23",

doi = "10.1109/ICSMC.2011.6084043",

language = "English",

isbn = "9781457706523",

series = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

pages = "2437--2442",

booktitle = "2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest",

note = "2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 ; Conference date: 09-10-2011 Through 12-10-2011",

}

TY - GEN

T1 - Disk allocation methods for Cartesian product files using unequal error protection codes

AU - Saito, Tomohiko

AU - Inazumi, Hiroshige

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2011/12/23

Y1 - 2011/12/23

N2 - Allocation methods for Cartesian product files on multiple disks using linear error-correcting codes are discussed. In this paper, we propose an allocation method using unequal error protection (UEP) codes. Codewords of an UEP code have some special bits which are protected against a greater number of errors than the other bits. We firstly assume a model that "*", which means "don't care", appears with different probability in each attribute of queries. In this case, the average access time can be calculated using the split distance distribution. Finally, we illustrate the average access time of the methods using UEP codes.

AB - Allocation methods for Cartesian product files on multiple disks using linear error-correcting codes are discussed. In this paper, we propose an allocation method using unequal error protection (UEP) codes. Codewords of an UEP code have some special bits which are protected against a greater number of errors than the other bits. We firstly assume a model that "*", which means "don't care", appears with different probability in each attribute of queries. In this case, the average access time can be calculated using the split distance distribution. Finally, we illustrate the average access time of the methods using UEP codes.

KW - Cartesian product file

KW - error-correcting codes

KW - file allocation

KW - partial match query

KW - unequal error protection codes

UR - http://www.scopus.com/inward/record.url?scp=83755229330&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755229330&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2011.6084043

DO - 10.1109/ICSMC.2011.6084043

M3 - Conference contribution

AN - SCOPUS:83755229330

SN - 9781457706523

T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

SP - 2437

EP - 2442

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 -

Disk allocation methods for Cartesian product files using unequal error protection codes

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this