Sciweavers

447 search results - page 47 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
ICDCS
2007
IEEE
15 years 6 months ago
Defragmenting DHT-based Distributed File Systems
Existing DHT-based file systems use consistent hashing to assign file blocks to random machines. As a result, a user task accessing an entire file or multiple files needs to r...
Jeffrey Pang, Phillip B. Gibbons, Michael Kaminsky...
DOLAP
1998
ACM
15 years 4 months ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
Junping Sun, William I. Grosky
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 12 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...
WISE
2002
Springer
15 years 4 months ago
A Content-Based Resource Location Mechanism in PeerIS
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in...
Bo Ling, Zhiguo Lu, Wee Siong Ng, Beng Chin Ooi, K...
CN
2010
136views more  CN 2010»
14 years 12 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl