Jan 16 · 3 min read · Traditional databases like MySQL and PostgreSQL use B-trees as their primary storage structure. B-trees modify data in place on disk, which means updates can happen at many different disk locations. This leads to random disk writes, which are expensi...
Join discussionDec 29, 2025 · 31 min read · High throughput isn't achieved by throwing more servers at the problem, it's earned through architectural decisions that align with how data is actually accessed and used. In this exploration, we'll dissect four systems that handle massive scale: Ama...
Join discussion
Dec 18, 2025 · 38 min read · Databases are one of the most important parts of a software system. They allow us to store huge amounts of data in an organized way and retrieve it efficiently when we need it. In the early days, when the volume of data was relatively small, engineer...
Join discussion
Sep 1, 2025 · 2 min read · Difficulty: Advanced Reading Time: 45 min read Last Updated: September 01, 2025 ⚡ Beyond B+-Trees: Write-Optimized Index Structures, Bitmap Indices, and PostgreSQL Databases live and die by their ability to access data efficiently. For decades, the ...
Join discussion
Apr 16, 2025 · 4 min read · If you’re diving into the world of database internals or exploring how modern NoSQL databases like Cassandra, RocksDB, or LevelDB handle massive amounts of writes, you’ll eventually run into the term LSM Tree — short for Log-Structured Merge Tree. In...
Join discussion
Aug 11, 2024 · 3 min read · Spoiler Alert - eheheh - just kidding! So databases need to do 2 things perfectly, store things and then retrieve them, now all the difference is how fast a database can do this and how efficiently. Okay, there is something called log, which is an ap...
Join discussion
Oct 4, 2023 · 24 min read · Introduction Let’s imagine that we had an idea of a start-up to get the athletes data about their bodies ( heart rates, muscle information, brain signals, breathing, and so on. not only while they are in the matches or training but in almost all day ...
Join discussion
Jul 20, 2023 · 8 min read · As an application developer, you must give some thought to your choice of database best suited for your needs since you are not going to implement your storage engine from scratch. In order to make the choice, you should at least have a rough idea of...
Join discussion
Nov 14, 2020 · 7 min read · Trong các bài trước, chúng ta đã tìm hiểu về các loại index phổ biến như Hash Index, LSM-Trees hay B-Trees, vốn được thiết kế chủ yếu cho các hệ thống OLTP (xử lý giao dịch trực tuyến). Tuy nhiên, khi chuyển sang môi trường OLAP (xử lý phân tích trực...
Join discussion
Oct 23, 2020 · 8 min read · B-Tree là một cấu trúc index được xây dựng dựa trên cấu trúc dữ liệu B-Tree, nhờ vậy nó kế thừa khả năng lưu trữ các cặp key-value một cách có thứ tự. Điều này giúp B-Tree hỗ trợ hiệu quả cả truy vấn tìm kiếm theo key lẫn truy vấn theo khoảng (range ...
Join discussion