
Designing Data-Intensive Applications – SSTables and LSM-Trees
Coding Blocks
00:00
Is Everything Fast for Small End, Okay?
The key here is trying to create a data base. This thissa log has to be fast, right? Like, when you write to this, they it has to be just as fast as possible. One option for doing that is a sordid structure, like a bee tree. That's one option. Another red black trees, a v al. These are basic trees that are meant to stay balanced. So maintaining a basic, a minimum number of hops to get to the data that you're looking or we keep that in memory. Its a, you know, specly a strategy for keeping things fast. And i said to disk a second agoand we'll get to that in
Play episode from 18:17
Transcript



