456 search results - page 21 / 92 » On Routing in Distributed Hash Tables |
ERLANG
2003
ACM
14 years 3 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
ISPAN
2005
IEEE
14 years 3 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
PODC
2003
ACM
14 years 3 months ago
2003
ACM
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
ICMCS
2010
IEEE
13 years 11 months ago
2010
IEEE
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...