Sciweavers

DEBS
2010
ACM
13 years 6 months ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis
JNW
2006
145views more  JNW 2006»
13 years 11 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
CN
2010
136views more  CN 2010»
13 years 11 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
DIM
2005
ACM
14 years 1 months ago
Establishing and protecting digital identity in federation systems
We develop solutions for the security and privacy of user identity information in a federation. By federation we mean a group of organizations or service providers which have buil...
Abhilasha Bhargav-Spantzel, Anna Cinzia Squicciari...
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
14 years 1 months ago
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
Thomas Reidemeister, Klemens Böhm, Paul A. S....
AICT
2006
IEEE
102views Communications» more  AICT 2006»
14 years 1 months ago
Publishing, Retrieving and Streaming Lectures via Application Level Multicast
Structured peer-to-peer overlay network is an efficient solution for querying and retrieving resources spread between the peers. Unfortunately, key based routing of Distributed Ha...
Marco Milanesio, Giancarlo Ruffo
HOTOS
2007
IEEE
14 years 3 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
AIMS
2009
Springer
14 years 4 months ago
Evaluation of Sybil Attacks Protection Schemes in KAD
In this paper, we assess the protection mechanisms entered into recent clients to fight against the Sybil attack in KAD, a widely deployed Distributed Hash Table. We study three m...
Thibault Cholez, Isabelle Chrisment, Olivier Festo...
IPTPS
2003
Springer
14 years 4 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
SIGCOMM
2003
ACM
14 years 4 months ago
Making gnutella-like P2P systems scalable
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized sea...
Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nic...