Hi, I'm curious how you deal with the potential for hash collisions across a lar... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		rkerno on Dec 20, 2023 \| parent \| context \| favorite \| on: Building a faster hash table for high performance ... Hi, I'm curious how you deal with the potential for hash collisions across a large data set - is that a post-join check?

puzpuzpuz-hn on Dec 21, 2023 [–]

Hi, if you're asking about the hash table itself, then currently we use linear probing, i.e. k/v pairs with a collision are inserted sequentially starting with the hash%capacity index.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact