News for hackers. Stuff that matters.

A comment on Why databases use ordered indexes but programming uses hash tables. Parent comment

Re:Why databases use ordered indexes but programming uses ha... by CoolGuySteve on Tuesday December 10, 2019 @03:25AM (#21750690)
But the point remains, walking the cache hierarchy once for a hash table is faster than walking it log times for a Btree.
[ Parent | on HN ]

There are no comments on this comment yet.