B-Tree vs LSM-Tree: The Index Trade-off
{"time":1780213482535,"blocks":[{"type":"header","data":{"level":2,"text":"B-Trees"}},{"type":"paragraph","data":{"text":"B-Trees keep data sorted on disk. Reads are O(log n) with excellent cache behaviour. But every…