Timeline for Long dictionary/map key vs shorter key + equality check for an auth cache
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 29, 2024 at 12:37 | vote | accept | Daniel Vernall | ||
| Jun 28, 2024 at 23:39 | history | edited | GoodNickname | CC BY-SA 4.0 | deleted 266 characters in body |
| Jun 28, 2024 at 23:38 | comment | added | GoodNickname | You're right. I remembered that Loadfactor can increase the speed without considering it's just the actual lookup speed. I'll edit my answer to remove that. | |
| Jun 28, 2024 at 23:21 | comment | added | Daniel Vernall | As a side point though, I don't think increasing the number of buckets will reduce a bottleneck caused by a long cache key. If hashing the cache key to look up the correct bucket takes too long, the way to fix it is to use a faster hashing algorithm (or shorter key) | |
| Jun 28, 2024 at 23:09 | history | edited | GoodNickname | CC BY-SA 4.0 | Fixed grammar |
| Jun 28, 2024 at 23:03 | comment | added | Daniel Vernall | Thanks for the answer, particularly the link at the end regarding collision probabilities. I hadn't realised how high a chance there would be of collision with 32 bit keys. | |
| Jun 28, 2024 at 22:07 | history | edited | GoodNickname | CC BY-SA 4.0 | added 1 character in body |
| S Jun 28, 2024 at 22:01 | review | First answers | |||
| Jun 30, 2024 at 11:26 | |||||
| S Jun 28, 2024 at 22:01 | history | answered | GoodNickname | CC BY-SA 4.0 |