Sciweavers

9 search results - page 1 / 2
» Scalable blind search and broadcasting over Distributed Hash...
Sort
View
COMCOM
2008
81views more  COMCOM 2008»
13 years 5 months ago
Scalable blind search and broadcasting over Distributed Hash Tables
Vladimir Vishnevsky, Alexander Safonov, Mikhail Ya...
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
13 years 10 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
INFOCOM
2003
IEEE
13 years 10 months ago
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...
Prasanna Ganesan, Qixiang Sun, Hector Garcia-Molin...
ANCS
2009
ACM
13 years 2 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
INFOCOM
2003
IEEE
13 years 10 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan