Indexing: B-Tree, LSM & Inverted

B+ trees vs LSM trees, write amplification, compaction, covering and composite indexes, and inverted indexes.

0 / 9 solved

Question Tags Difficulty Success

composite-indexquery-planning

Easy —

covering-indexindex-only-scan +1

Medium —

postgresexplain +2

Medium —

Basics

Medium 53%

composite-indexindex-column-order +2

Medium —

brinindex-selection +2

Medium —

lsm-treesstable +2

Hard —

postgrescovering-index +2

Hard —

write-amplificationlsm-tree +3

Hard —

9 of 9 questions here are still unsolved.