Sciweavers

346 search results - page 41 / 70
» Routing networks for distributed hash tables
Sort
View
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
14 years 1 months ago
A Content-Addressable Network for Similarity Search in Metric Spaces
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content– addressable Network (CAN) parad...
Fabrizio Falchi, Claudio Gennaro, Pavel Zezula
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 9 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...
WISE
2002
Springer
14 years 15 days 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»
13 years 7 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
PCI
2005
Springer
14 years 1 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris