How databases scale writes: The power of the log ✍️🗒️

Databases with heavy write workloads need write friendly architectures. Log Structured Merge Trees are an efficient alternative to B+ trees, as they scale writes better.

0:00 Request Condensing
2:00 Log using linked list
5:00 B-plus Tree vs Linked List
6:08 Sorted String Table
10:42 Compaction
13:17 Bloom Filters

#Database #Log #SystemDesign

Looking to ace your next interview? Try this System Design video course! 🔥
https://get.interviewready.io

Course chapters:
1) Design an email service like Gmail
2) Design a rate limiter
3) Design an audio search engine
4) Design a calling app like WhatsApp
5) Design and code a payment tracking app like Splitwise
6) Machine coding a cache
7) Low level design of an event bus

The chapters have architectural diagrams and capacity estimates, along with subtitled videos. Use the coupon code of ‘earlybird’ to get a 20% discount.

System Design Playlist: https://www.youtube.com/playlist?list=PLMCXHnjXnTnvo6alSjVkgxV-VH6EPyvoX

References:
Designing Data Intensive Applications –
https://amzn.to/2yQIrxH
Google Big Table Whitepaper –
https://static.googleusercontent.com/media/research.google.com/en//archive/bigtable-osdi06.pdf
Log Structured Merge Trees –
https://en.wikipedia.org/wiki/Log-structured_merge-tree
https://www.cs.umb.edu/~poneil/lsmtree.pdf
Bloom Filter:

You can follow me on:
Facebook: https://facebook.com/gkcs0/
Quora: https://www.quora.com/profile/Gaurav-Sen-6
LinkedIn: https://www.linkedin.com/in/gaurav-sen-56b6a941/
Twitter: https://twitter.com/gkcs_