Re:The trouble with soft delete
by nixme on Saturday November 21, 2009 @11:05PM
(#955391)
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).
[ Parent
| on HN ]