Abstract. We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queri...
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
Nikos Ntarmos, Theoni Pitoura, Peter Triantafillou
Abstract. In this paper we propose a semantic based P2P system that incorporates peer sharing policies, which allow a peer to state, for each of the concepts it deals with, the con...
Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions...
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...
Intelligent Web search engines are extremely popular now. Currently, only commercial centralized search engines like Google can process terabytes of Web data. Alternative search en...
Sergey Chernov, Pavel Serdyukov, Matthias Bender, ...
In this paper, we present the use of semantic caching in the environment of schema-based super-peer networks. Different from traditional caching, semantic caching allows the answe...
We propose a novel approach for de ning and querying a super-peer within a schema-based super-peer network organized into a two-level architecture: the low level, called the peer l...
Open peer-to-peer architectures offer many possibilities for replicating database content, but designers have to deal with problems such as peer churn rates and inherent uncertain...