Day 29/100
Designing Data-Intensive Applications [Book Highlights]
[Part I : Chapter III] Storage and Retrieval
B-Trees
The most widely used indexing structure is the B-tree.
B-trees keep key-value pairs sorted by key, which allows efficient keyvalue lookups a...
rawdatareaders.hashnode.dev3 min read