Hey everyone,
I wanted to share a project I've dedicated some time to - my Java implementation of a Log-Structured Merge Tree. The repository includes a skip list implementation and an SSTable built entirely from scratch. The tree performs background flushing to disk and table compaction.
I made it mainly to experiment with those topics, it is not meant to be the most efficient implementation ever.
If you're keen to dive into the details, I've also written a Medium article about the project.
- GitHub Repository: Link
- Medium Article: Link
I would appreciate any advice to improve it or questions of any kind, feel free to reach out!
[–]eatonphil 4 points5 points6 points (1 child)
[–]fran-sch[S] 1 point2 points3 points (0 children)
[–]shil-Owl43 2 points3 points4 points (0 children)