Abstract
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.
This work was supported by Fondecyt Grant 1-93-0765.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R.A. “Expected Behaviour of B+-trees under Random Insertions”. Acta Information, 26(5):439–472, 1989.
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.
Baeza-Yates, R. “Modeling Splits in File Structures”, Acta Informatica, 26(4):349–362, 1989.
Baeza-Yates, R. “Bounded Disorder: The Effect of the Index”, Technical report, Dept. of Computer Science, University of Chile, 1989.
Baeza-Yates, R.A. “A Storage Allocation Algorithm suitable for File Structures”, Information Systems 15, 5 (1990), 515–521.
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.
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.
Litwin, W. and Lomet, D. “The Bounded Disorder Access Method”, Proc. IEEE Conference on Data Engineering, Los Angeles, 1986, 38–48.
Litwin, W. and Lomet, D. “A New Method for Fast Data Searches with Keys”, IEEE Software 4, 2 (1987), 16–24.
Lomet, D. “Digital B-Trees”, Proc. 7th VLDB, Cannes, 1981, 333–344.
Lomet, D. “A Simple Bounded Disorder File Organization with Good Performance”, ACM TODS, 13 (1988), 525–551.
Matsliach, G. “Performance Analysis of File Organizations that use multi-bucket data leaves”, Information Processing Letters 36 (1990), 301–310.
Ramakrishna, M. and Mukhopadhyay, P. “Analysis of Bounded Disorder file organization”, Proc. 7th PODS, San Francisco, 1988, 117–125.
Ramakrishna, M. “Computing the probability of hash table/urn overflow”, Communications in Statistics — Theory and Methods, 16 (1987), 3343–3353.
Ramakrishna, M. “An Exact Probability Model for Finite Hash Tables”, Proc. 4th IEEE Conf. on Data Enginnering, Los Angeles, 1988, 362–368.
Salzberg, B. File Structures: An Analytic Approach, Prentice Hall, 1988.
Yao, A.C. “On Random 2–3 Trees”, Acta Informatica 9 (1978), 159–180.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baeza-Yates, R.A. (1994). Analysis of bounded disorder. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_70
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive