Summary
Organization and maintenance of an index for a dynamic random access file is considered. It is assumed that the index must be kept on some pseudo random access backup store like a disc or a drum. The index organization described allows retrieval, insertion, and deletion of keys in time proportional to log k I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal. Storage utilization is at least 50% but generally much higher. The pages of the index are organized in a special datastructure, so-called B-trees. The scheme is analyzed, performance bounds are obtained, and a near optimal k is computed. Experiments have been performed with indexes up to 100000 keys. An index of size 15000 (100000) can be maintained with an average of 9 (at least 4) transactions per second on an IBM 360/44 with a 2311 disc.
Preview
Unable to display preview. Download preview PDF.
References
Adelson-Velskii, G. M., Landis, E. M.: An information organization algorithm. DANSSSR, 146, 263–266 (1962).
Foster, C. C.: Information storage and retrieval using AVL trees. Proc. ACM 20th Nat’l. Conf. 192-205 (1965).
Landauer, W. I.: The balanced tree and its utilization in information retrieval. IEEE Trans, on Electronic Computers, Vol. EC-12, No. 6, December 1963.
Sussenguth, E.H., Jr.: The use of tree structures for processing files. Comm. ACM, 6, No. 5, May 1963.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag
About this chapter
Cite this chapter
Bayer, R., McCreight, E.M. (1972). Organization and Maintenance of Large Ordered Indexes. In: Broy, M., Denert, E. (eds) Pioneers and Their Contributions to Software Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48354-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-48354-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42290-7
Online ISBN: 978-3-642-48354-7
eBook Packages: Springer Book Archive