Higher-Order Analysis of 2-3 Trees

  title={Higher-Order Analysis of 2-3 Trees},
  author={Ricardo Baeza-Yates and Patricio V. Poblete},
  journal={Int. J. Found. Comput. Sci.},
We present a fourth-order fringe analysis for the expected behavior of 2–3 trees, which includes 97% of the elements in the tree. It is accomplished by exploiting the structure of the transition matrix. Our results improve a number of bounds, in particular the bounds on the expected number of nodes and the expected space utilization. We also study 2–3 trees built by using overflow techniques. 
Fringe analysis for parallel MacroSplit insertion algorithms in 2--3 trees
The fringe analysis is extended to deal with synchronous parallel insertions on 2--3 trees and two approximated analysis prove that the parallelinsertions case does not differ significantly from the sequential case, namely on the terms O(1/n^2).
Fringe Analysis of 2-3 Trees with Lazy Parent Split
2‐3 trees with lps have slightly better performance, more keys in the fringe, larger storage utilization and a slightly shorter path length from the root to the leaves.
Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees
On Rotations in Fringe-Balanced Binary Trees
Self-organization and evolution on large computer data structures
This work introduced and studied experimentally three statistical magnitudes: the stress of a tree, the sequence of jump points and the distribution of subtrees inside a tree and obtained a potential law for stress distribution.
Persistently Cached B-Trees
This paper presents an approach to enhancing B-tree indexing performance by using a replication technique called persistent caching, and evaluates the performance of persistently cached B-trees by showing the result of mathematical analysis and of experimental investigations.


Fringe analysis revisited
The main results regarding fringe analysis are surveyed, a previous asymptotic theorem is improved, and new developments and applications of the theory are presented that allow improvements in several bounds on the behavior of search trees.
Some Observations on Random 2-3 Trees
Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
From an urn containing colored balls, one ball is drawn and replaced by a random number of differently colored balls, with the distribution of the added balls depending only on the color of the ball
Approaches to Concurrency in B-Trees
The solut ions avai lable at the present time are surveyed, two main types of solut ion are proposed, which categorize almost a l l Solut ions in the l i t e r a t u r e .
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
This chapter discusses algorithms in the context of graph programming, and some examples of algorithms used in the programming languages such as Python and Ruby are discussed.
An asymptotic analysis of minimum order B-trees
  • Dept. of Computing and Information Sciences
  • 1976
Reduction of the transition matrix of a fringe analysis and its application to the analysis of 2-3 trees
  • 5th International Conference of the Chilean Computer Science Society
  • 1985
On random 3-2 trees
  • On random 3-2 trees
  • 1974