Time- and Space-Optimality in B-Trees

ACM Transactions on Database Systems (TODS)

Volumn 6, Issue 1, 1981, Pages 174-193

  Rosenberg, Arnold L ^a   Snyder, Lawrence ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

2,3 tree; B tree; bushy B tree; compact B tree; node visit cost; space utilization

Indexed keywords

DATA PROCESSING;

EID: 0019541551     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/319540.319565     Document Type: Article

References (7)

1. Bayer, R., And McCreight, E. Organization and maintenance of large ordered indexes. Acta Informatica 1, 3 (1972), 173-189.
2. Bayer, R., And Unterauer, K. Prefix B-trees. ACM Trans. Database Syst. 2, 1 (March 1977), 11-26.
3. Knuth, D. E. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading, Mass., 1973.
4. Miller, R. E., Pippenger, N., Rosenberg, A. L., And Snyder, L. Optimal 2, 3 trees. SIAM J. Comput. 8, 1 (1979), 42-59.
5. Rosenberg, A. L., And Snyder, L. Minimal comparison 2, 3 trees. SIAM J. Comput. 7, 4 (1978), 465-480.
6. Snyder, L. On uniquely represented data structures. Proc. 18th Annu. Conf Foundations of Computer Science, 1977, pp. 412-417.
7. Yao, A. C. On random 2, 3 trees. Acta Informatica 9, 3 (1978), 159-170.