I have not studied how Perl implements its hash tables;

Hashes are hash tables. Collisions are handled using linked lists. Perl keeps the number of entries in the linked list small through array-size doublings and hash perturbation. It has optimizations to reuse keys.