On the existence and construction of non-extreme (a, b)-trees

Authors:
Lars Jacobsen;Kim S. Larsen;Morten N. Nielsen
Affiliations:
Department of Mathematics and Computer Science, University of Southern Denmark, Main campus: Odense University, Campusvej 55, DK-5230 Odense M, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Main campus: Odense University, Campusvej 55, DK-5230 Odense M, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Main campus: Odense University, Campusvej 55, DK-5230 Odense M, Denmark
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 1

Relaxed multi-way trees with group updates

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Sublogarithmic searching without multiplications

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Relaxed multi-way trees with group updates

Journal of Computer and System Sciences - Special issu on PODS 2001

Quantified Score

Hi-index	0.89

Visualization

Abstract

In amortized analysis of data structures, it is standard to assume that initially the structure is empty. Usually, results cannot be established otherwise. In this paper, we investigate the possibilities of establishing such results for initially non-empty multiway trees.