Disk allocation for Cartesian product files on multiple-disk systems

H. C. Du; J. S. Sobolewski

doi:10.1145/319682.319698

Disk allocation for Cartesian product files on multiple-disk systems

ACM Transactions on Database Systems ◽

10.1145/319682.319698 ◽

1982 ◽

Vol 7 (1) ◽

pp. 82-101 ◽

Cited By ~ 118

Author(s):

H. C. Du ◽

J. S. Sobolewski

Keyword(s):

Cartesian Product ◽

Disk Allocation

Download Full-text

Performance analysis of disk allocation methods for cartesian product files by using error-correcting codes

Electronics and Communications in Japan (Part III Fundamental Electronic Science) ◽

10.1002/ecjc.4430750103 ◽

1992 ◽

Vol 75 (1) ◽

pp. 20-30

Author(s):

Minoru Ito ◽

Tadao Kasami ◽

Mituteru Kataoka ◽

Toru Fujiwara ◽

Jun Okui

Keyword(s):

Performance Analysis ◽

Cartesian Product ◽

Error Correcting Codes ◽

Disk Allocation ◽

Allocation Methods

Download Full-text

An optimal disk allocation strategy for partial match queries on non-uniform cartesian product files

Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999 ◽

10.1109/ipps.1999.760531 ◽

2003 ◽

Cited By ~ 1

Author(s):

S.K. Das ◽

M.C. Pinotti

Keyword(s):

Cartesian Product ◽

Allocation Strategy ◽

Partial Match ◽

Disk Allocation

Download Full-text

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

Proceedings of IEEE International Conference on Systems, Man and Cybernetics ◽

10.1109/icsmc.1994.400060 ◽

2002 ◽

Author(s):

T. Kohnosu ◽

T. Nishijima ◽

S. Hirasawa

Keyword(s):

Cartesian Product ◽

Error Correcting Codes ◽

Disk Allocation ◽

Allocation Methods

Download Full-text

Disk allocation methods for binary Cartesian product files

BIT Numerical Mathematics ◽

10.1007/bf01933739 ◽

1986 ◽

Vol 26 (2) ◽

pp. 138-147 ◽

Cited By ~ 23

Author(s):

H. C. Du

Keyword(s):

Cartesian Product ◽

Disk Allocation ◽

Allocation Methods

Download Full-text

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

2011 IEEE International Conference on Systems, Man, and Cybernetics ◽

10.1109/icsmc.2011.6084043 ◽

2011 ◽

Author(s):

Tomohiko Saito ◽

Hiroshige Inazumi ◽

Toshiyasu Matsushima ◽

Shigeichi Hirasawa

Keyword(s):

Cartesian Product ◽

Unequal Error Protection ◽

Error Protection ◽

Disk Allocation ◽

Allocation Methods

Download Full-text

System evaluation of disk allocation methods for Cartesian product files by using error correcting codes

2011 IEEE International Conference on Systems, Man, and Cybernetics ◽

10.1109/icsmc.2011.6084044 ◽

2011 ◽

Cited By ~ 2

Author(s):

Shigeichi Hirasawa ◽

Tomohiko Saito ◽

Hiroshige Inazumi ◽

Toshiyasu Matsushima

Keyword(s):

Cartesian Product ◽

Error Correcting Codes ◽

System Evaluation ◽

Disk Allocation ◽

Allocation Methods

Download Full-text

On the optimality of disk allocation for Cartesian product files (extended abstract)

Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '90 ◽

10.1145/298514.298578 ◽

1990 ◽

Cited By ~ 1

Author(s):

Khaled A. S. Abdel-Ghaffar ◽

Amr El Abbadi

Keyword(s):

Cartesian Product ◽

Disk Allocation

Download Full-text

CARTESIAN PRODUCT ON FUZZY IDEALS OF A TERNARY Γ-SEMIGROUP

Advances in Mathematics: Scientific Journal ◽

10.37418/amsj.9.3.44 ◽

2020 ◽

Vol 9 (3) ◽

pp. 1189-1195 ◽

Cited By ~ 1

Author(s):

Y. Bhargavi ◽

T. Eswarlal ◽

S. Ragamayi

Keyword(s):

Cartesian Product

Download Full-text

The chromatic difference sequence of the Cartesian product of graphs

Discrete Mathematics ◽

10.1016/0012-365x(91)90150-z ◽

1991 ◽

Vol 90 (3) ◽

pp. 297-311 ◽

Cited By ~ 9

Author(s):

Huishan Zhou

Keyword(s):

Cartesian Product ◽

Difference Sequence ◽

Cartesian Product Of Graphs ◽

Product Of Graphs

Download Full-text

THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES

Bulletin of the Australian Mathematical Society ◽

10.1017/s0004972720001276 ◽

2020 ◽

pp. 1-10

Author(s):

JING TIAN ◽

KEXIANG XU ◽

SANDI KLAVŽAR

Keyword(s):

Shortest Path ◽

Connected Graph ◽

General Position ◽

Cartesian Product

Abstract The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position number is additive on the Cartesian product of two trees.

Download Full-text