UBIQUITOUS B-TREE

[1] Aho A., Ullman J., The design and analysis of computer algorithms, (1974)

[2] Auer R., Schlusselkompressionen in B*-baumen, (1976)

[3] Bayer R., McCreight C., Organization and maintenance of large ordered indexes, Acta Inf., 1, 3, pp. 173-189, (1972)

[4] Bayer R., Binary B-trees for virtual memory, Proc 1971 ACM SIGFIDET Workshop, pp. 219-235

[5] Bayer R., Symmetric binary B-trees. data structure and maintenance algorithms, Acta Inf., 1, 4, pp. 290-306, (1972)

[6] Bayer R., Metzger J., On encipherment of search trees and random access files, ACM Trans. Database Syst., 1, 1, pp. 37-52, (1976)

[7] Bayer R., Unterauer K., Prefix B-trees, ACM Trans. Database Syst., 2, 1, pp. 11-26, (1977)

[8] Bayer R., Schkolnick M., Concurrency of operations on B-trees, Acta Inf., 9, 1, pp. 1-21, (1977)

[9] Berliner H., The B*-tree search algorithm: a best-first proof procedure, (1978)

[10] Brown M., A storage scheme for height-balanced trees, Inf. Process. Lett., 7, 5, pp. 231-232, (1978)

[1] Aho A., Ullman J., The design and analysis of computer algorithms, (1974)

[2] Auer R., Schlusselkompressionen in B*-baumen, (1976)

[3] Bayer R., McCreight C., Organization and maintenance of large ordered indexes, Acta Inf., 1, 3, pp. 173-189, (1972)

[4] Bayer R., Binary B-trees for virtual memory, Proc 1971 ACM SIGFIDET Workshop, pp. 219-235

[5] Bayer R., Symmetric binary B-trees. data structure and maintenance algorithms, Acta Inf., 1, 4, pp. 290-306, (1972)

[6] Bayer R., Metzger J., On encipherment of search trees and random access files, ACM Trans. Database Syst., 1, 1, pp. 37-52, (1976)

[7] Bayer R., Unterauer K., Prefix B-trees, ACM Trans. Database Syst., 2, 1, pp. 11-26, (1977)

[8] Bayer R., Schkolnick M., Concurrency of operations on B-trees, Acta Inf., 9, 1, pp. 1-21, (1977)

[9] Berliner H., The B*-tree search algorithm: a best-first proof procedure, (1978)

[10] Brown M., A storage scheme for height-balanced trees, Inf. Process. Lett., 7, 5, pp. 231-232, (1978)