Transactions on Red-black and AVL trees in NVRAM
Thorsten Sch\"utt, Florian Schintke, Jan Skrzypczak

TL;DR
This paper introduces a generic, in-place transaction mechanism for complex data structures in NVRAM, enabling durable, crash-resilient updates with minimal memory overhead, demonstrated on Red-Black and AVL trees.
Contribution
It presents a novel in-place transaction method with constant memory overhead, suitable for byte-addressable NVRAM, applicable to complex data structures like trees.
Findings
Constant size redo log guarantees transaction completion after crashes.
Supports durable linearizability with minimal overhead.
Effective in local and remote NVRAM environments.
Abstract
Byte-addressable non-volatile memory (NVRAM) supports persistent storage with low latency and high bandwidth. Complex data structures in it ought to be updated transactionally, so that they remain recoverable at all times. Traditional database technologies such as keeping a separate log, a journal, or shadow data work on a coarse-grained level, where the whole transaction is made visible using a final atomic update operation. These methods typically need significant additional space overhead and induce non-trivial overhead for log pruning, state maintenance, and resource (de-)allocation. Thus, they are not necessarily the best choice for NVRAM, which supports fine-grained, byte-addressable access. We present a generic transaction mechanism to update dynamic complex data structures `in-place' with a constant memory overhead. It is independent of the size of the data structure. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Data Storage Technologies · Parallel Computing and Optimization Techniques
