
Designing Data-Intensive Applications – SSTables and LSM-Trees
Coding Blocks
00:00
Is There a Way to Do That?
There is levelled compaction, in which key ranges are split into smaller tables. Older a data is moved to different levels i'm guessing level d b is this one. Both uses ok, level compaction. So they are basically split into smaller s tables, and the old data is moved down to harder level. I tell you, i am constant getting my rock to be stucklocked andi the directory. It seems so weird to say that the answer could be maybe, maybe. Such a beautiful a, it's definitelyeo,It's definitely no. Or, i don't know, eh, no, it mag be e forever. Ther's oe, major answer,
Play episode from 01:02:26
Transcript



