4 ms·
A few ms, with cold cache (both OS and postgres). The IN() roughly scales linearly with the number of elements, although it's often a bit better, as the upper t
by anarazel 7y ago
A few ms, with cold cache (both OS and postgres). The IN() roughly scales linearly with the number of elements, although it's often a bit better, as the upper tree levels are all in cache after the first few IN() element lookups.
- lcnmrn 7y agoI manage to replicate your performance, but I used a hash type index on the hash column.