Databases

Question 1

How do indexes improve db performance?

Answer 1

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

Question 2

What is a b-tree?

Answer 2

B-trees are self balancing but the b does not stand for balanced.