正在加载视频...
视频加载失败
LSMs are fun because they combine a bunch of data structures into one! Trees / skip-lists as the storage format. Bloom filters for faster lookups. Priority queues for efficient merges. A little clip from last week's stream showing how the latter works for LSM chunk merging.
89,180 次观看 • 6 个月前 •via X (Twitter)
0 条评论
暂无评论
原始帖子的评论将显示在这里
