Analysis of bounded disorder

  • Ricardo A. Baeza-Yates
Part of the Lecture Notes in Computer Science book series (LNCS, volume 841)


In 1988 Ramakrishna and Mukhopadhyay presented an exact analysis for a data node in the Bounded Disorder (BD) file organization of Litwin and Lomet. Here, we complete their analysis by introducing the B-tree index into the model. Also, we extend the analysis to the case of BD files with two partial expansions as proposed by Lomet. Our main contribution is a detailed analysis of search and insertion costs, and its comparison with B+-trees.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baeza-Yates, R.A. “Expected Behaviour of B+-trees under Random Insertions”. Acta Information, 26(5):439–472, 1989.Google Scholar
  2. 2.
    Baeza-Yates, R. and Larson, P-Å. “Performance of B+-trees with Partial Expansions”, IEEE Trans. on Knowledge and Data Engineering, 1:248–257, June 1989.Google Scholar
  3. 3.
    Baeza-Yates, R. “Modeling Splits in File Structures”, Acta Informatica, 26(4):349–362, 1989.Google Scholar
  4. 4.
    Baeza-Yates, R. “Bounded Disorder: The Effect of the Index”, Technical report, Dept. of Computer Science, University of Chile, 1989.Google Scholar
  5. 5.
    Baeza-Yates, R.A. “A Storage Allocation Algorithm suitable for File Structures”, Information Systems 15, 5 (1990), 515–521.Google Scholar
  6. 6.
    Baeza-Yates, R.A. “An Adaptive Overflow Technique for the B-tree”, Extending Data Base Technology Conference (EDBT 90), F. Bancilhon, C. Thanos and D. Tsichritzis, Springer Verlag Lecture Notes in Computer Science 416, Venice, March, 1990, 16–28.Google Scholar
  7. 7.
    Eisenbarth, B., Ziviani, N., Gonnet, G., Mehlhorn, K. and Wood, D. “The Theory of Fringe Analysis and Its Application to 2–3 Trees and B-Trees”, Information and Control 55, 1–3 (1982), 125–174.Google Scholar
  8. 8.
    Litwin, W. and Lomet, D. “The Bounded Disorder Access Method”, Proc. IEEE Conference on Data Engineering, Los Angeles, 1986, 38–48.Google Scholar
  9. 9.
    Litwin, W. and Lomet, D. “A New Method for Fast Data Searches with Keys”, IEEE Software 4, 2 (1987), 16–24.Google Scholar
  10. 10.
    Lomet, D. “Digital B-Trees”, Proc. 7th VLDB, Cannes, 1981, 333–344.Google Scholar
  11. 11.
    Lomet, D. “A Simple Bounded Disorder File Organization with Good Performance”, ACM TODS, 13 (1988), 525–551.Google Scholar
  12. 12.
    Matsliach, G. “Performance Analysis of File Organizations that use multi-bucket data leaves”, Information Processing Letters 36 (1990), 301–310.Google Scholar
  13. 13.
    Ramakrishna, M. and Mukhopadhyay, P. “Analysis of Bounded Disorder file organization”, Proc. 7th PODS, San Francisco, 1988, 117–125.Google Scholar
  14. 14.
    Ramakrishna, M. “Computing the probability of hash table/urn overflow”, Communications in Statistics — Theory and Methods, 16 (1987), 3343–3353.Google Scholar
  15. 15.
    Ramakrishna, M. “An Exact Probability Model for Finite Hash Tables”, Proc. 4th IEEE Conf. on Data Enginnering, Los Angeles, 1988, 362–368.Google Scholar
  16. 16.
    Salzberg, B. File Structures: An Analytic Approach, Prentice Hall, 1988.Google Scholar
  17. 17.
    Yao, A.C. “On Random 2–3 Trees”, Acta Informatica 9 (1978), 159–180.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Ricardo A. Baeza-Yates
    • 1
  1. 1.Depto. de Ciencias de la ComputaciónUniversidad de ChileSantiagoChile

Personalised recommendations