Selective information dissemination in P2P networks: Problems and solutions

Abstract

We study the problem of selective dissemination of information in P2P networks. We present our work on data models and languages for textual information dissemination and discuss a relevant P2P architecture that motivates our efforts. We also survey our results on the computational complexity of three related algorithmic problems (query satisfiability, entailment and filtering) and present efficient algorithms for the most crucial of these problems (filtering). Finally, we discuss the features of P2P-DIET, a super-peer system we have implemented at the Technical University of Crete, that realizes our vision and is able to support both ad-hoc querying and selective information dissemination scenarios in a P2P framework.