3 ms·
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).
by nixme 17y ago
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).
- jbert 17y agoThanks, I was thinking in terms of hashes (which doesn't really make sense for searching/ordering).