[erlang-questions] finding the nearest key in a key-value table

Dmitry Kolesnikov dmkolesnikov@REDACTED
Tue May 27 15:00:14 CEST 2014


On 27 May 2014, at 15:56, Jesper Louis Andersen <jesper.louis.andersen@REDACTED> wrote:

> 
> On Tue, May 27, 2014 at 2:55 PM, Joe Armstrong <erlang@REDACTED> wrote:
> Now why would anybody want to put 20 byte binaries in a hash table and find the K nearest hits :-)
> 
> Distributed Hash Table rings ;)

In this case, k-bucket is the right data structure to keep nodes.  


> 
> -- 
> J.
> _______________________________________________
> erlang-questions mailing list
> erlang-questions@REDACTED
> http://erlang.org/mailman/listinfo/erlang-questions

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20140527/7b6b28d6/attachment.htm>


More information about the erlang-questions mailing list