Sciweavers

79 search results - page 7 / 16
» Comparing the Performance of Distributed Hash Tables Under C...
Sort
View
ECIR
2006
Springer
14 years 10 months ago
Comparing Different Architectures for Query Routing in Peer-to-Peer Networks
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional "resourc...
Henrik Nottelmann, Norbert Fuhr
EDCC
2010
Springer
15 years 2 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
IPPS
2007
IEEE
15 years 3 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
PARBASE
1990
69views more  PARBASE 1990»
14 years 10 months ago
A Vectorization Technique of Hashing and Its Application to Several Sorting Algorithms
This paper presents a vectorized algorithm for entering data into a hash table. A program that enters multiple data could not be executed on vector processors by conventional vect...
Yasusi Kanada
P2P
2008
IEEE
15 years 3 months ago
Faster Content Access in KAD
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e...
Moritz Steiner, Damiano Carra, Ernst W. Biersack