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...
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...
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
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...
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...
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...
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 ...
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...
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, ...
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...