74 search results - page 1 / 15 » DHTs over Peer Clusters for Distributed Information Retrieva... |
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
CN
2010
13 years 5 months ago
2010
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...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
Peer-to-Peer (P2P) networking is aimed at exploiting the potential of widely distributed information pools and its effortless access and retrieval irrespectively of underlying net...
ERCIMDL
2008
Springer
13 years 6 months ago
2008
Springer
We present iClusterDL, a self-organising overlay network that supports information retrieval and filtering functionality in a digital library environment. iClusterDL is able to han...