/1 What are the differences between B-Tree and LSM-Tree? 
/2 ๐-๐๐ซ๐๐
B-Tree is the most widely used indexing data structure in almost all relational databases.
The basic unit of information storage in B-Tree is usually called a โpageโ. To look up a key, it traces down the range of keys until the actual value is found.
B-Tree is the most widely used indexing data structure in almost all relational databases.
The basic unit of information storage in B-Tree is usually called a โpageโ. To look up a key, it traces down the range of keys until the actual value is found.
/3 ๐๐๐-๐๐ซ๐๐
LSM-Tree (Log-Structured Merge Tree) is widely used by many NoSQL databases, such as Cassandra, LevelDB, and RocksDB.
LSM-trees maintain key-value pairs and are persisted to disk using a Sorted Strings Table (SSTable), in which the keys are sorted.
LSM-Tree (Log-Structured Merge Tree) is widely used by many NoSQL databases, such as Cassandra, LevelDB, and RocksDB.
LSM-trees maintain key-value pairs and are persisted to disk using a Sorted Strings Table (SSTable), in which the keys are sorted.
/4 Level 0 segments are periodically merged into Level 1 segments. This process is called ๐๐จ๐ฆ๐ฉ๐๐๐ญ๐ข๐จ๐ง.
The biggest difference is probably this:
๐นB-Tree enables faster reads
๐นLSM-Tree enables fast writes
The biggest difference is probably this:
๐นB-Tree enables faster reads
๐นLSM-Tree enables fast writes
/5 Over to you: 1). do you know why? 2) Which database system have you used and does it use B-Tree or LSM-Tree?
/6 I hope you've found this thread helpful.
Follow me @alexxubyte for more.
Like/Retweet the first tweet below if you can:
Follow me @alexxubyte for more.
Like/Retweet the first tweet below if you can:
https://twitter.com/alexxubyte/status/1583119489318518786
โข โข โข
Missing some Tweet in this thread? You can try to
force a refresh
ใ
