2 docs tagged with "b-tree"

A binary search tree is $O(\log n)$ only while it stays short, and nothing in the plain

Without an index, finding a row that matches a condition means reading every row in the table — a