343 search results - page 16 / 69 » Weighted distributed hash tables |
JNW
2006
13 years 8 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
DEBS
2010
ACM
13 years 3 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...