On-the-fly optimization of data structures

DOI10.1145/182.358442MaRDI QIDQ3668834zbMATH OpenOpenAlexFDO

Authors Joep L. W. Kessels

Publication date 1983

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/182.358442

zbMATH Keywords

binary search treeconcurrent accessequivalence classesglobal optimization

Mathematics Subject Classification ID

Data structures (68P05)

Cited in

(9)

• Efficient rebalancing of chromatic search trees
• Amortization results for chromatic search trees, with an application to priority queues
• Relaxed avl trees, main-memory databases and concurrency
• Parallel dictionaries with local rules on AVL and brother trees
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• Efficient rebalancing of chromatic search trees
• Relaxed balance through standard rotations
• Variants of (a,b)-trees with relaxed balance
• AVL trees with relaxed balance

This page was built for publication: On-the-fly optimization of data structures

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