Hacker News new | past | comments | ask | show | jobs | submit login

I've noticed that sorted sets have noticeably more overhead than the other types.



If that's true, I wonder why. Maybe is they are trying to get O(1) access? Storing it the 'default' way would be O(log n) which isn't bad, but might still be unacceptable.


Ah, I found my answer. Sets are stored in both a skip list and a hash table. So the overhead is indeed high.




Consider applying for YC's W25 batch! Applications are open till Nov 12.

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

Search: