Hey data folks! 👋
Ever been in those endless debates about data lake performance? "We need faster reads!" "No, we need faster writes!" "What about storage costs?"
Here's what I've learned: there's no magic bullet. Every data system faces a fundamental trade-off between reads and writes. You simply can't have it all.
In this episode, I break down:
• How B-Trees and LSM Trees work under the hood
• The core concepts of Merge On Read (MOR) and Copy On Write (COW)
• How modern table formats implement these strategies
• When to use each approach
No fluff, just practical insights to help you make better decisions for your data systems.
Check it out and let me know what you think!
-----------------
🍜 Still here? You must really like this stuff – I appreciate it!
If you enjoyed this post, come grab another tech bite with CodeCookCash:
▶️ YouTube: youtube.com/@codecookcash
📝 Blog: codecookcash.substack.com
👋 Want more behind-the-scenes and tech-life reflections?
Connect with Huong Vuong:
💼 LinkedIn: linkedin.com/in/hoaihuongbk
📘 Facebook: facebook.com/hoaihuongbk
💡 Follow for fun – read for depth – learn at your pace.
Share this post