DB Data Structures

https://github.com/ByteByteGoHq/system-design-101?tab=readme-ov-file#8-data-structures-that-power-your-databases

Skip List

https://nitinkc.github.io/system%20design/SkipLists/

Hash index:

a very common implementation of the “Map” data structure (or “Collection”)

SSTable - Sorted String Tables

(https://nitinkc.github.io/system%20design/SSTables/)[https://nitinkc.github.io/system%20design/SSTables/]

LSM tree: Skiplist + SSTable

https://nitinkc.github.io/system%20design/LSM-Tree/

B-tree:

disk-based solution. Consistent read/write performance

Inverted index:

used for document indexing. Used in Lucene

Suffix tree:

for string pattern search

R-tree:

multi-dimension search, such as finding the nearest neighbor