Chaining

noun

say it: “CHAYN-ing” /ˈtʃeɪnɪŋ/

A way of handling collisions in which each bucket of a hash table holds a short list of entries.

What is chaining in a hash table?

Chaining is how most hash tables handle collisions: each bucket holds a short list, a chain, of key-value pairs. A put adds to its bucket's chain; a get hashes the key, then compares keys along that one chain until it finds a match.

In a sentence

  • “With chaining, Maya and Zoe both hang on hook 0, and a lookup checks their name tags one after the other.”

Level: Journeyman · More Data Structures terms at this level

Updated