Efficient rebalancing of chromatic search trees

DOI10.1016/S0022-0000(05)80075-3zbMATH Open0938.68612MaRDI QIDQ1342864FDOQ1342864

Joan Boyar, Kim S. Larsen

Publication date: 21 June 2000

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

Mathematics Subject Classification ID

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

Cites Work

• On-the-fly optimization of data structures
• Organization and maintenance of large ordered indexes
• Title not available (Why is that?)

Cited In (9)

• Amortization results for chromatic search trees, with an application to priority queues
• Relaxed balance through standard rotations
• Amortization results for chromatic search trees, with an application to priority queues
• Relaxed multi-way trees with group updates.
• Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
• Relaxed avl trees, main-memory databases and concurrency
• Red-black trees with constant update time
• VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
• AVL trees with relaxed balance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342864)