News for hackers. Stuff that matters.
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).
Re:The trouble with soft delete by jbert on Monday November 23, 2009 @04:27AM (#957124)
Thanks, I was thinking in terms of hashes (which doesn't really make sense for searching/ordering).