Skip to main content
Log in

Analysis for the end of block wasted space

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

Abstract

The problem examined in this report is the calculation of the average wasted space at the end of the block when variable length records are inserted in the file. Previous efforts are based in approximations. Here, a detailed analysis based on Markov chains gives the exact solution. A framework is presented which shows the relations between the previous approaches. The proposed model includes the previous models as special limiting cases. Simulation results close to the analytic results are also presented.

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. S. Christodoulakis,Estimating block selectivities, Information Systems, Vol. 9, No. 1, 1984.

  2. S. Christodoulakis,Implications of certain assumptions in database performance evaluation, ACM Transactions on Database Systems, Vol. 9, No. 2, pp. 163–187, 1984.

    Google Scholar 

  3. S. Christodoulakis, Y. Manolopoulos and P. Å. Larson,Analysis of overflow handling for variable length records, Information Systems, Vol. 14, No. 1, pp. 151–162, 1989.

    Google Scholar 

  4. D. R. Cox,Renewal Theory, Methuen, London, 1967.

    Google Scholar 

  5. C. J. Date,Introduction to Database Systems, John Wiley, Vol. 1, 4th edition, 1988.

  6. J. Hakola and A. Heiskanen,On the distribution of wasted space at the end of file blocks, BIT, Vol. 20, No. 2, pp. 145–156, 1980.

    Google Scholar 

  7. G. U. Hubbard,Computer-assisted Database Design, Van Nostrand Reinhold Company, 1981.

  8. L. Kleinrock:Queueing Systems, Vol. I: Theory, John Wiley, NY, 1975.

    Google Scholar 

  9. Y. Manolopoulos and S. Christodoulakis,File organizations with shared overflow blocks for variable length objects, submitted.

  10. Y. Manolopoulos and N. Fistas,Algorithms for a hash based file with variable length records, Information Sciences, to appear.

  11. T. Sellis,Global query optimization, ACM Transactions on Database Systems, Vol. 13, No. 1, pp. 23–53, 1988.

    Google Scholar 

  12. T. J. Teorey and J. P. Fry,Design of Database Structures, Prentice Hall, NJ, 1982.

    Google Scholar 

  13. G. Wiederhold,File Organization for Database Design, McGraw-Hill, NY, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was sponsored partially by the National Science Foundation under the grants DCR-86-16833, IRI-8719458 and IRI-8958546 and by the Air Force Office of Scientific Research under grant AFOSR-89-0303.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Manolopoulos, Y., Faloutsos, C. Analysis for the end of block wasted space. BIT 30, 620–630 (1990). https://doi.org/10.1007/BF01933210

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR categories and subject descriptors

General terms

Key-words

Navigation