Abstract
A technique called folding for mapping file buckets to multiple disks is evaluated. In particular, an upper bound to expected costs given any size partial match query is found. Folding is compared to Disk Modulo allocation.
Similar content being viewed by others
References
H. C. Du and J. S. Sobolewski.Disk allocation for Cartesian product files on multiple-disk systems. ACM Trans. Database Syst. 7, 1 (March 1982), pp. 82–101.
C. L. Liu,Introduction to Combinatorial Mathematics, McGraw-Hill, New York (1968).
J. P. Tremblay and P. G. Sorenson,An Introduction to Data Structures with Applications, McGraw-Hill, New York (1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chan, M.Y. Multidisk file design: An analysis of folding buckets to disks. BIT 24, 261–268 (1984). https://doi.org/10.1007/BF02136024
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02136024