Random B-Trees With Inserts and Deletes (Classic Reprint) - Softcover

Inhaltsangabe

Understand how B-trees behave under mixed inserts and deletes. This detailed study guides readers through analytical models and simulations that predict how much of a B-tree remains utilized, how often nodes split or merge, and what the height of the tree might look like under different operation mixes.

The book examines two main B-tree variants and compares their performance in realistic workloads. It explains how ghosts (deleted items still affecting structure) are modeled and how different strategies impact space utilization and restructuring rates.

• Clear explanations of equilibrium structures and utilization under parameterized insert/delete mixes


• Two B-tree variants: merge-at-empty and merge-at-half, with comparisons to real-world behavior


• Simulation results that validate analytical predictions about splits, merges, and height

Ideal for readers of database systems, data structures, and performance modeling who want a rigorous, math‑driven look at B-trees in dynamic workloads.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.