Sciweavers

371 search results - page 10 / 75
» XML Query Routing in Structured P2P Systems
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 1 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
P2P
2006
IEEE
211views Communications» more  P2P 2006»
14 years 1 months ago
Comparison of Image Similarity Queries in P2P Systems
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
Wolfgang Müller 0002, P. Oscar Boykin, Nima S...
WWW
2004
ACM
14 years 8 months ago
P-tree: a p2p index for resource discovery applications
We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree. P-trees efficiently support range queries in addit...
Adina Crainiceanu, Prakash Linga, Johannes Gehrke,...
CCGRID
2009
IEEE
14 years 2 months ago
Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems
This paper presents “Self-Chord”, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computati...
Agostino Forestiero, Carlo Mastroianni, Michela Me...
DIWEB
2004
13 years 9 months ago
Distributed Query Processing in P2P Systems with Incomplete Schema Information
The peer-to-peer (P2P) paradigm has emerged recently, mainly by file sharing systems like Napster or Gnutella and in terms of scalable distributed data structures. Because of the d...
Marcel Karnstedt, Katja Hose, Kai-Uwe Sattler