> With Redis B-tree structure, the creation and deletion are cheap. Pretty sure redis has no b-tree but hashmap. But redis has to do no compaction at all since

> With Redis B-tree structure, the creation and deletion are cheap. Pretty sure redis has no b-tree but hashmap. But redis has to do no compaction at all since it can directly delete the stuff on disk. > The rate is about 3000 files per second created and then deleted. Being a LSM structure, the tombstones quickly pile up and the directory listing was slow. The problem here also is the gc-perdiod. Since the database has async-replication, it needs to keep deleted rows for some days so downed replicas can replicate. So they stay in disk/memory for some days actually and don't get compacted. While in a CP system they would be.