Skip to main content
Log in

Multidisk file design: An analysis of folding buckets to disks

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. C. L. Liu,Introduction to Combinatorial Mathematics, McGraw-Hill, New York (1968).

    Google Scholar 

  3. J. P. Tremblay and P. G. Sorenson,An Introduction to Data Structures with Applications, McGraw-Hill, New York (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02136024

Keywords

Navigation