Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Improving collection selection with overlap awareness in P2P search engines
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Publish/subscribe functionality in IR environments using structured overlay networks
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
MINERVA: collaborative P2P search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Client-side web mining for community formation in peer-to-peer environments
ACM SIGKDD Explorations Newsletter
Is high-quality vod feasible using P2P swarming?
Proceedings of the 16th international conference on World Wide Web
IEEE Transactions on Knowledge and Data Engineering
On the design of hybrid peer-to-peer systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Full-text indexing and information retrieval in P2P systems
Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
Distributed Decision-Tree Induction in Peer-to-Peer Systems
Statistical Analysis and Data Mining
A decision-theoretic model for decentralised query routing in hierarchical peer-to-peer networks
ECIR'07 Proceedings of the 29th European conference on IR research
OverCite: a cooperative digital research library
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Federated search of text-based digital libraries in hierarchical peer-to-peer networks
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
MinervaDL: an architecture for information retrieval and filtering in distributed digital libraries
ECDL'07 Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries
| Hi-index | 0.00 |
Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of internet traffic. P2P systems have emerged as a popular way to share huge volumes of data. Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of P2P systems called schema-based. In such systems each peer is a database management system in itself, exposing its own schema. In such settings, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. The usability of these systems depends on effective techniques to find and retrieve data; however, efficient and effective routing of content-based queries is an emerging problem in P2P networks. In this paper, we propose an architecture, based on (super-)peers, and we focus on query routing. Our approach considers that (super-)Peers having similar interests are grouped together for an efficient query routing method. In such groups, called knowledge-super-peers (KSP), super-peers submit queries that are often processed by members of this group. A KSP is a specific super-peer which contains knowledge about: 1. its super-peers and 2. the others super-peers. Knowledge is extracted by using data mining techniques (e.g. decision tree algorithms) starting from queries of peers that transit on the network. The advantage of this distributed knowledge is that, it avoids to making semantic mapping, between heterogeneous data sources owned by (super-)peers, each time the system decides to route query to other (super-)peers. The set of KSP improves the robustness in queries routing mechanism and scalability in P2P Network. Compared with a baseline approach, our proposal shows a better performance with respect to important criteria such as response time, precision and recall.