4 ms·
But the point remains, walking the cache hierarchy once for a hash table is faster than walking it log times for a Btree.
by CoolGuySteve 7y ago
But the point remains, walking the cache hierarchy once for a hash table is faster than walking it log times for a Btree.