undefined | Better HN

0 pointsnixme16y ago0 comments

Simple explanation: Most database indexes are forms of B-trees. Insertion into a binary tree isn't constant time O(1), it's usually O(log n).

0 comments

1 comments · 1 top-level

jbert16y ago

Thanks, I was thinking in terms of hashes (which doesn't really make sense for searching/ordering).

j / k navigate · click thread line to collapse