
Designing Data-Intensive Applications – SSTables and LSM-Trees
Coding Blocks
00:00
Sordid String Tables - Chapter Three
If you have not listened to the previous episode, or you have not read this chapter, you will probably be lost w ome of the concepts that were about to go over. We specifically left off with hash indexes yet last time. Let's talk about string sort tables, or no, sordid string tables. And we got joe, allan and michael here, at least in the video order that i'm looking at. If joe comes in first, you can't write it to the log first, because then it'll be out of order,. And so if allan comes in right after that, well then, ok, well then that should probably go before that
Play episode from 06:11
Transcript



