1080 search results - page 47 / 216 » Distributed Hash Tables |
118
Voted
AIRS
2004
Springer
15 years 8 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
144
Voted
CIKM
1994
Springer
15 years 6 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
93
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
125
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...