Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

split/join functionality #14

Open
ghost opened this issue Oct 21, 2017 · 3 comments
Open

split/join functionality #14

ghost opened this issue Oct 21, 2017 · 3 comments

Comments

@ghost
Copy link

ghost commented Oct 21, 2017

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.

@w8r
Copy link
Owner

w8r commented Jan 1, 2018

I will be thinking of adding it.

@w8r
Copy link
Owner

w8r commented Apr 17, 2018

can you recite a paper that I can follow?

@junzhengca
Copy link

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants