Efficient persistent data structures for relational database

Question

I\'m looking for material on persistent data structures that can be used to implement a relational model.

Persistence in the meaning of immutable data structures.

Answer 1

It is straightforward to modify the ubiquitous B-tree to be persistent. Simply always alloctate a new node whenever a node is modified, and return the new node to the recursive caller, who will insert it at that level by allocating a new node, etc. Ultimate the new root node is returned. No more than O(log N) nodes are allocated per operation.

This is the technique used in functional languages to implement, e.g, 2-3 trees.