zbMATH — the first resource for mathematics

Organization and maintenance of large ordered indexes. (English) Zbl 0226.68008

68P05 Data structures
68M15 Reliability, testing and fault tolerance of networks and computer systems
Full Text: DOI
[1] Adelson-Velskii, G. M., Landis, E. M.: An information organization algorithm. DANSSSR, 146, 263-266 (1962).
[2] Foster, C. C.: Information storage and retrieval using AVL trees. Proc. ACM 20th Nat’1. Conf. 192-205 (1965).
[3] Landauer, W. I.: The balanced tree and its utilization in information retrieval. IEEE Trans. on Electronic Computers, Vol. EC-12, No. 6, December 1963. · Zbl 0137.11001
[4] Sussenguth, E. H., Jr.: The use of tree structures for processing files. Comm. ACM, 6, No. 5, May 1963.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.