We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
A high priority in the next version release (after 0.1) is to speed-up range query by introducing a new index type.
There are two common choices: skip list or b+ tree.
B+tree: complex implementation, the common practice. Skip list: very simple implementation, less common to see in DB implementations.
Which one to go with?
The text was updated successfully, but these errors were encountered:
HouzuoGuo
No branches or pull requests
A high priority in the next version release (after 0.1) is to speed-up range query by introducing a new index type.
There are two common choices: skip list or b+ tree.
B+tree: complex implementation, the common practice.
Skip list: very simple implementation, less common to see in DB implementations.
Which one to go with?
The text was updated successfully, but these errors were encountered: