Bounded disorder: The effect of the index

Theoretical Computer Science

Volumn 168, Issue 1, 1996, Pages 21-38

  Baeza Yates, Ricardo A ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

FILE ORGANIZATION; MATHEMATICAL MODELS; TREES (MATHEMATICS);

BOUNDED DISORDER; TREE INDEXING;

COMPUTATION THEORY;

EID: 0030284346     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00061-8     Document Type: Article

References (19)

1. +-trees under random insertions, Acta Inform. 26 (1989) 439-472.
2. R.A. Baeza-Yates, Modeling splits in file structures, Acta Inform. 26 (1989) 349-362.
3. R.A. Baeza-Yates, Bounded disorder: the effect of the index, Tech. Report, Dept. of Computer Science, University of Chile, 1989.
4. R.A. Baeza-Yates, A storage allocation algorithm suitable for file structures, Inform. Systems 15 (1990) 515-521.
5. R.A. Baeza-Yates, An adaptive overflow technique for the B-tree, in: F. Bancilhon, C. Thanos and D. Tsichritzis, eds., Extending Data Base Technology Conference (EDBT' 90), Venice, Lecture Notes in Computer Science, Vol. 416 (Springer, Berlin, 1990) 16-28.
6. R.A. Baeza-Yates, Analysis of bounded disorder, in: B. Rovan I. Privara and P. Ruzicka, eds., Proc. 19th MFCS'94, Kosice, Slovakia, Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1994) 233-244.
7. +-trees with partial expansions, IEEE Trans. Knowledge Data Eng. 1 (1989) 248-257.
8. B. Eisenbarth, N. Ziviani, G. Gonnet, K., Mehlhorn and D. Wood, The theory of fringe analysis and its application to 2-3 trees and B-trees, Inform. and Control 55 (1982) 125-174.
9. W. Litwin and D. Lomet, The bounded disorder access method, Proc. IEEE Conf. on Data Engineering, Los Angeles (1986) 38-48.
10. W. Litwin and D. Lomet, A new method for fast data searches with keys, IEEE Software 4 (1987) 16-24.
11. D. Lomet, Digital B-trees, Proc. 7th VLDB, Cannes (1981) 333-344.
12. D. Lomet, A simple bounded disorder file organization with good performance, ACM TODS 13 (1988) 525-551.
13. G. Matsliach, Performance analysis of file organizations that use multi-bucket data leaves, Inform. Process. Lett. 36 (1990) 301-310.
14. M. Ramakrishna, Computing the probability of hash table/urn overflow, Comm. Statistics - Theory Methods 16 (1987) 3343-3353.
15. M. Ramakrishna, An exact probability model for finite Hash tables, in: Proc. 4th IEEE Conf. on Data Engineering, Los Angeles (1988) 362-368.
16. M. Ramakrishna, Bounded disorder file organization, IEEE Trans. Knowledge Eng. 6 (1994) 79-85.
17. M. Ramakrishna and P. Mukhopadhyay, Analysis of bounded disorder file oraganization, Proc. 7th PODS, San Francisco (1988) 117-125.
18. B. Salzberg, File Structures: An Analytic Approach (Prentice-Hall, Englewood Cliffs, NJ, 1988).
19. A.C. Yao, On random 2-3 trees, Acta Inform. 9 (1978) 159-180.