LSM Tree: Log-Structured Merge Tree
B-trees have dominated database indexing for decades, but they carry a fundamental limitation: random I/O on writes. Every insert or update potentially requires reading a page, modifying it, and…
Read more →B-trees have dominated database indexing for decades, but they carry a fundamental limitation: random I/O on writes. Every insert or update potentially requires reading a page, modifying it, and…
Read more →