Chapter 24, Problem 1PE

Explanation of Solution

Log-Structured Merge-Tree (LSM Tree):

• The Log-Structured Merge is an important technique used in many modern data stores.
• The LSM tree is a data structure is designed to provide low-cost indexing for files experiencing a high rate of inserts. It is done over an extended period.
• The LSM trees perform better on update queries.

Reason for LSM is preferred:

• Compared to LSM trees, the buffer trees require more random I/O for insert operations. This is the major difference between buffer trees and LSM trees.
• The LSM perform more sequential I/O operations.
• LSM trees are preferred because, for Big Data setting where data is resident on magnetic disks, random I/O is significantly more expensive than sequential I/O.