CaskDB
Learning and science
educational database project
SHOW HN2022
175points
12comments
#344of 2,570 in 2022
Top 14%of 2022 by points
How HN took it
LovedMost comments that take a side are positive
5 positive, 2 neutral or asking, 0 mixed, 0 critical, out of 7 comments about the project. Thread score +0.52.
Idea: 3 for, 0 againstDocs: 2 for, 0 against
The thread, comment by comment
Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.
positive neutral or mixed critical about another commenter or something else the maker
What HN said
What people liked
Good, thorough documentation and TDD-style learning path
From 3 comments
That is some thorough documentation!
ofpiyush on HNThis looks excellent! Nit: Typo in the hyperlink to the paper.
unmole on HNHey HN! For the past few months, I have been learning about the internals of database systems. After doing a batch at Recurse Center (Nov 2021) researching databases, I have been…
avinassh on HN
Useful for learning system design and databases
From 1 comment
Nice project! I have been studying system design recently and read a lot about Dynamo, Cassandra, Kafka, etc. and I realized that they have much more in common than I thought.…
kwizzt on HN
Bitcask paper is clear and approachable
From 2 comments
Nice! A (really terrible) Bitcask implementation was one of the first things I ever wrote in Go (https://github.com/pandemicsyn/bitcasket). Had no clue wtf i was doing but the…
pandemicsyn on HNYes! bitcask paper is straightforward to read and understand. The idea of bitcask was suggested to Riak's devs when Eric Brewer (of CAP theorem fame) joined Riak's board: > None…
avinassh on HN
Questions
How Bitcask compares in performance to LSM trees and B+trees
From 2 comments
I hadn't heard about bitcask before. Its design looks like a great alternative to LSM trees or B+trees like lmdb. Are there any good benchmarks comparing the approaches? The…
josephg on HNI am not aware of any benchmarks with rocksdb (LSM) or lmdb (b-tree), but theoretically it will be much faster at the cost of extra RAM - In Bitcask, reads have at most single…
avinassh on HN
Whether Bitcask's compaction cost matters in practice
From 2 comments
The other downside of Bitcask is that it requires periodic compaction operations to avoid continuously increasing disk utilization. LSM trees and B+Trees do this work "on the…
josephg on HNLSM also requires periodic compaction, right? > I'm not sure how big a downside that is in practice, but it might be unfair to compare lmdb or rocksdb with bitcask if bitcask is…
avinassh on HN
Alternatives named
RocksDB (LSM tree)
From 1 comment
I am not aware of any benchmarks with rocksdb (LSM) or lmdb (b-tree), but theoretically it will be much faster at the cost of extra RAM - In Bitcask, reads have at most single…
avinassh on HN
LMDB (B+tree)
From 2 comments
I hadn't heard about bitcask before. Its design looks like a great alternative to LSM trees or B+trees like lmdb. Are there any good benchmarks comparing the approaches? The…
josephg on HNI am not aware of any benchmarks with rocksdb (LSM) or lmdb (b-tree), but theoretically it will be much faster at the cost of extra RAM - In Bitcask, reads have at most single…
avinassh on HN