We currently use a LLRB-Tree as backend for our persistent data-structures. It has O(log n) average and worst case time and space complexity. However, there are other data-structures that can be more efficient either in general or in special use cases. We should explore such data-structures for use-cases that we know of.
Possible new data-structures:
We currently use a LLRB-Tree as backend for our persistent data-structures. It has O(log n) average and worst case time and space complexity. However, there are other data-structures that can be more efficient either in general or in special use cases. We should explore such data-structures for use-cases that we know of.
Possible new data-structures: