News for hackers. Stuff that matters.

A comment on B-Trees Require Fewer Comparisons Than Balanced Binary Search Trees. Parent comment

Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by fanf2 on Monday June 24, 2024 @07:19AM (#40774674)
Trees require a lot more memory indirections than hashmaps, which makes them slower to traverse. They require a lot more interior pointers, which makes them bigger. It’s easy for a hashmap to beat a tree.
[ Parent | on HN ]
Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by globular-toast on Monday June 24, 2024 @08:11AM (#40775081)
Not in the worst case.
[ Parent | on HN ]
Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by sqeaky on Monday June 24, 2024 @01:12PM (#40778501)
Which will be the developers responsibility to know when that is and is rarely the default or normal case.
[ Parent | on HN ]