References

4-1. ADELSON-VELSki, G. M. and Lanpis, E. M., Doklady Akademia Nauk

4-2. Bayer, R. and McCreiGcut, E., “Organization and Maintenance of Large

4-3. , “Binary B-trees for Virtual Memory,” Proc. 1971 ACM SIGFIDET

Workshop, San Diego, Nov. 1971, pp. 219-35.

4-4, , “Symmetric Binary B-trees: Data Structure and Maintenance

4-6. Knutu, D. E., “Optimum Binary Search Trees,” Acta Informatica, 1, No. 1

4-7. Maurer, W. D., “An Improved Hash Code for Scatter Storage,” Comm.

4-8. Morris, R., “Scatter Storage Techniques,” Comm. ACM, 11, No. 1 (1968),

4-9. PrTERSON, W. W., “Addressing for Random-access Storage,” JBM J. Res.

4-10. ScHay, G. and Sprutn, W., “Analysis of a File Addressing Method,” Comm.

4-11. Waker, W. A. and Gort Lies, C. C., “A Top-down Algorithm for Construct-