I found the incremental approach used in redis to be most interesting (http://an... | Hacker News

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

MHammond on Sept 26, 2014 | parent | context | favorite | on: Relativistic hash tables

I found the incremental approach used in redis to be most interesting (http://antirez.com/news/63).

Can you comment on how one can safely enumerate "all" keys of the hashtable, while minimizing contention.

It would be great to know whether, in principle, rhashtable can offer such a capability.

JoshTriplett on Sept 26, 2014 [–]

> Can you comment on how one can safely enumerate "all" keys of the hashtable, while minimizing contention.

for each bucket:

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