split/join functionality

Question

Opened this issue 7 years ago · 3 comments

I might be wrong, but i'm missing split/join functionality.

Unluckily i need to code a B+ Tree, and the leaf needs to be ordered somehow efficiently.

I jumped into associative arrays, but even if it's ordered you don't know anything about the "real" index, where it's inserted.

Answer 1 · 2018-01-01T19:52:51.000Z

I will be thinking of adding it.

Answer 2 · 2018-04-17T14:56:40.000Z

can you recite a paper that I can follow?

Answer 3 · 2019-02-05T00:48:47.000Z

https://arxiv.org/pdf/1602.02120.pdf
Here is a paper discussing the set operations on AVL trees. In case you are still interested.