Abstract
In this paper we explore the use of weak B-trees to represent sorted lists. In weak B-trees each node has at least a and at most b sons where 2a ≤ b. We analyse the worst case cost of sequences of insertions and deletions in weak B-trees. This leads to a new data structure (level-linked weak B-trees) for representing sorted lists when the access pattern exhibits a (time-varying) locality of reference. Our structure is substantially simpler than the one proposed by Guibas, McCreight, Plass and Roberts, yet it has many of its properties. Our structure is as simple as the one proposed by Brown/Tarjan, but our structure can treat arbitrary sequences of insertions and deletions whilst theirs can only treat non-interacting insertions and deletions.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bayer/McCreight: "Organization and Maintenance of Large Ordered Indizes", Acta Informatica 1 (1972), 173–189
Blum/Mehlhorn: "On the Average Number of Rebalancing Steps in Weight-Balanced Trees", 4th GI-Conference on Theoretical Computer Science, Aachen 1979, LNCS Vol. 67, 67–78
Brown/Tarjan: "A Representation for Linear Lists with Movable Fingers", 10th ACM Symposium on Theory of Computing, p. 19–28, 1978
Guibas/McCreight/Plass/Roberts: "A new representation for linear lists", 9th ACM Symposium on Theory of Computing, 1977, 49–60
Mehlhorn: "Effiziente Algorithmen", Teubner-Verlag, Studienbücher Informatik, 1977
Mehlhorn 79a: "Sorting Presorted Files", 4th GI-Conference on Theoretical Computer Science, Aachen 1979, LNCS, Vol. 67, p. 199–212
Mehlhorn 79b: "Searching, Sorting and Information Theory", MFCS 79, Springer Lecture Notes in Computer Science, Vol. 74, p. 131–145
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehlhorn, K. (1981). A new data structure for representing sorted lists. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive