Sciweavers

118 search results - page 10 / 24
» Small world peer networks in distributed web search
Sort
View
AINA
2007
IEEE
14 years 2 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
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...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
13 years 5 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...
DAGSTUHL
2007
13 years 9 months ago
Calculus and Algebra for Distributed Data Management
Abstract. The sharing of content by communities of users (e.g., scientists) in a P2P context remains cumbersome. We argue that main reasons for this is the lack of calculus and alg...
Serge Abiteboul
WWW
2004
ACM
14 years 8 months ago
Site-to-site (s2s) searching using the p2p framework with cgi
Peer-To-Peer (P2P) networks like Gnutella improve some shortcomings of Conventional Search Engines (CSE) such as centralized and outdated indexing by distributing the search engin...
Wan Yeung Wong
HPDC
2003
IEEE
14 years 29 days ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...