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.

Sign up for GitHub

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

Jump to bottom

Switch to lockless data structures #1

Open
penberg opened this issue Apr 9, 2023 · 1 comment
Open

Switch to lockless data structures #1

penberg opened this issue Apr 9, 2023 · 1 comment
Labels
enhancement New feature or request good first issue Good for newcomers help wanted Extra attention is needed

Comments

@penberg
Copy link
Owner

penberg commented Apr 9, 2023

The current code uses a mutex to essentially make commit() and rollback() and other operations atomic. Let's switch to lockless data structures like Hekaton.
@penberg penberg added enhancement New feature or request help wanted Extra attention is needed good first issue Good for newcomers labels Apr 9, 2023
@penberg
Copy link
Owner Author

penberg commented May 14, 2023

AFAICT, Hekaton uses a Bw-Tree for its index. However, the "Building a Bw-Tree Takes More Than Just Buzz Words" paper by Wang et al (SIGMOD’18) claims that skip list, adaptive radix tree, and masstree performs better, so maybe let's look into those. For example, https://docs.rs/crossbeam-skiplist/latest/crossbeam_skiplist/ might be a good candidate.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request good first issue Good for newcomers help wanted Extra attention is needed
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@penberg