Efficient rebalancing of chromatic search trees

DOI10.1016/S0022-0000(05)80075-3MaRDI QIDQ1342864zbMATH OpenFDO

Authors Kim S. Larsen, Joan Boyar

Publication date 21 June 2000

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

Full work available at URL https://doi.org/10.1016/S0022-0000(05)80075-3

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• On-the-fly optimization of data structures
• Organization and maintenance of large ordered indexes

Cited in

(9)

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

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)