Designing DIA note 16 -- B-tree optimization, LSM-tree advantages
3.1.3.1makingB-treesreliablethebasicunderlyingwriteoperationofaB-treeistooverwriteapageondiskwithnewdata(nolocationchange,incontrastwithLSM-trees)someoperationsrequireseveraldifferentpagestobeoverwrit