1
Q
How do indexes improve db performance?
A
Indexes can greatly improve read speed by creating a b-tree for the value you need to search. So instead of search o(n) all the rows youre really search o(log n) - the tree. This can intern slow down write speed
2
Q
What is a b-tree?
A
B-trees are self balancing but the b does not stand for balanced.
3
Q
A
System Design
flashcards
Decks in class (17)
# Cards
