Abstract
In this paper, we present a method, called the partition data allocation method, to allocate a set of data into a multi-disk system. Using the partition data allocation method, we shall show that, in a two-disk system, the performance is influenced by how we disperse similar data onto different disks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Y. Chan,Multidisk file design: An analysis of folding buckets to disks, BIT, Vol. 24, (1984), pp. 262–268.
M. Y. Chan,A note on redundant disk modulo allocation, Information Processing Letters, Vol. 20, (1985), pp. 121–123.
C. C. Chang and C. Y. Chen,Lower bounds of using disk modulo allocation method to allocate Cartesian product files in a two-disk system, Proceedings of International Computer Symposium, Tainan, Taiwan, Dec. 1986, pp. 770–774.
C. C. Chang and C. Y. Chen,Performance analysis of the generalized disk modulo allocation method for multiple key hashing files on multi-disk systems, to appear in the Computer Journal, United Kingdom.
C. C. Chang, M. D. Hsiao and C. H. Lin,Algorithms to allocate a file for concurrent disk accessing, Proceedings of the 6th Advanced Database System Symposium, Tokyo, Japan, August 1986.
C. C. Chang and L. S. Lian,On strict optimality property of allocating binary Cartesian product files on multiple disk systems, Proceedings of the International Conference on Foundation of Data Organization, Kyoto, Japan, May 1985, pp. 104–112.
C. C. Chang and Y. L. Lu,The complexity of multi-disk data allocation problem, Proceedings of National Computer Symposium, Kaoshung, Taiwan, Dec. 1985, pp. 468–471.
C. C. Chang and J. J. Shen,Performance analysis of the disk modulo allocation method for concurrent accessing on multiple disk systems, Journal of the Chinese Institute of Engineers, Vol. 8, No. 3, (1985), pp. 271–283.
C. C. Chang and J. J. Shen,Consecutive retrieval organization as a file allocation scheme on multiple disk systems, Proceedings of the International Conference on Foundation of Data Organization, Kyoto, Japan, May 1985, pp. 74–80.
H. C. Du,Disk allocation methods for binary Cartesian product files, BIT, Vol. 26, (1986), pp. 138–147.
H. C. Du and J. S. Sobolewski,Disk allocation for Cartesian product files on multiple disk systems, ACM Trans. Database Systems, Vol. 7, March 1982, pp. 82–101.
M. T. Fang, R. C. T. Lee and C. C. Chang,The idea of de-clustering and its applications, 12th International Conference on Very Large Data Bases, Kyoto, Japan, August 1986, pp. 181–188.
D. E. Knuth,The Art of Computer Programming, Vol. 1,Fundamental Algorithms, second edition (1973), Addison-Wesley, Reading, Massachusetts.
C. L. Liu,Introduction to Combinatorial Mathematics, (1968), McGraw-Hill, Reading, New York.
T. S. Yuen and H. C. Du,Dynamic file structure for partial match retrieval based on overflow bucket sharing, IEEE Transactions on Software Engineering, Vol. SE-12, No. 8, August 1986, pp. 801–810.