455 search results - page 1 / 91 » Distributed Processes on Tree Hash |
COMPSAC
2006
IEEE
13 years 9 months ago
2006
IEEE
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
CCR
2004
13 years 5 months ago
2004
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
NBIS
2007
Springer
13 years 11 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
EDBTW
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...