EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE

DOI10.1142/S0129054196000142zbMath0852.68019MaRDI QIDQ4886316

Rolf Fagerberg, Kim S. Larsen

Publication date: 26 November 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

shared-memory asynchronous parallel architecturesrebalancingB-trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (6)

Amortization results for chromatic search trees, with an application to priority queues ⋮ Relaxed balance through standard rotations ⋮ Relaxed multi-way trees with group updates. ⋮ AVL trees with relaxed balance ⋮ Amortization results for chromatic search trees, with an application to priority queues ⋮ VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE

This page was built for publication: EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE