Efficient rebalancing of chromatic search trees

DOI10.1016/S0022-0000(05)80075-3zbMath0938.68612MaRDI QIDQ1342864

Kim S. Larsen, Joan. Boyar

Publication date: 21 June 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)

Related Items (8)

Amortization results for chromatic search trees, with an application to priority queues ⋮ Relaxed balance through standard rotations ⋮ Red-black trees with constant update time ⋮ Relaxed multi-way trees with group updates. ⋮ Relaxed avl trees, main-memory databases and concurrency ⋮ 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

Cites Work

• Organization and maintenance of large ordered indexes
• On-the-fly optimization of data structures
• Unnamed Item

This page was built for publication: Efficient rebalancing of chromatic search trees