Can I read Efficient Relaxed Red-Black Trees on EtoBox?

Efficient Relaxed Red-Black Trees by ANDA_INFO3339 is a document available to read on EtoBox.

What is Efficient Relaxed Red-Black Trees about?

This document proposes a new technique for relaxed balancing of red-black trees. Relaxed balancing allows updates like insertions and deletions to be delayed and interleaved with searches, rather than requiring rebalancing immediately after each update. The key ideas are to 1) mark nodes for deletion rather than immediately removing them, 2) allow trees to grow randomly below the balanced part, and 3) settle accumulated updates and rebalancing requests in a top-down manner using the standard red-black tree

Author

ANDA_INFO3339

Language

EN