EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
From MaRDI portal
Publication:4886316
DOI10.1142/S0129054196000142zbMath0852.68019MaRDI QIDQ4886316
Publication date: 26 November 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68P05: Data structures
Related Items
VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE, AVL trees with relaxed balance, Amortization results for chromatic search trees, with an application to priority queues, Relaxed multi-way trees with group updates.