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

Seems like an obvious optimization to use a hash instead of scanning the array with comparisons... but I bet it's hard because on small arrays sequentially scanning is faster than building a hash first. Does anyone know at what size the optimizer switches from scanning the list to a hash?


Based on my experiments, Postgres switches from scanning the list to a hash when the array size > 8.




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

Search: