On-the-fly optimization of data structures

DOI10.1145/182.358442zbMATH Open0519.68025OpenAlexW1973610879MaRDI QIDQ3668834FDOQ3668834

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

global optimizationequivalence classesbinary search treeconcurrent access

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (9)

• Amortization results for chromatic search trees, with an application to priority queues
• Relaxed balance through standard rotations
• Efficient rebalancing of chromatic search trees
• 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
• 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)