-
Notifications
You must be signed in to change notification settings - Fork 315
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
how to do range search? help wanted #9
Comments
I did not consider this range search interface closely. But the implementation is quite simple. Since the keys strored in leaf nodes have been sorted, once you get the first element of the leaf node, you can traverse the next leaves until it touches the upside of the range given. The leaves traversed are what you need to query. Therefore it is an O(n) query algorithm. |
Thanks for your provided solution. I found it has been shown how to do range search. the code following in
I will close this issue. |
there is a
bplus_tree_get_range
method there and it turns out this method only returns the first element of bplustree belong the range. However, this is not so great considering range query.So how to iterator the results of range query, the interfaces which have been provided currently is not enough. How can do that? help wanted::::
The text was updated successfully, but these errors were encountered: