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.