Query Routing and Processing in Peer-To-Peer Data Sharing Systems
Raddad Al King, Abdelkader Hameurlain, Franck Morvan

TL;DR
This paper reviews advancements in P2P data sharing systems, focusing on query routing and processing challenges due to their large scale and lack of global catalogs, and analyzes solutions and case studies in this domain.
Contribution
It provides a comprehensive analysis of solutions for query routing and processing in P2P data sharing systems, highlighting recent developments and comparing key systems.
Findings
P2P systems have evolved to support fine-grained data sharing and expressive queries.
Challenges include locating data sources and generating efficient execution plans without global catalogs.
Case studies reveal diverse approaches to query routing and data management in P2P systems.
Abstract
Sharing musical files via the Internet was the essential motivation of early P2P systems. Despite of the great success of the P2P file sharing systems, these systems support only "simple" queries. The focus in such systems is how to carry out an efficient query routing in order to find the nodes storing a desired file. Recently, several research works have been made to extend P2P systems to be able to share data having a fine granularity (i.e. atomic attribute) and to process queries written with a highly expressive language (i.e. SQL). These works have led to the emergence of P2P data sharing systems that represent a new generation of P2P systems and, on the other hand, a next stage in a long period of the database research area. ? The characteristics of P2P systems (e.g. large-scale, node autonomy and instability) make impractical to have a global catalog that represents often an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
