|
|
|
     |
                                     |
Return to Peer-to-Peer System
Peer-to-peer (P2P) architectures are commonly used for file-sharing applications. The reasons for P2P's popularity in file sharing, fault tolerance, scalability, and ease of deployment also make it a good model for distributed data management. In this paper, we introduce a scalable P2P framework for distributed data management applications using mutant query plans: XML serializations of algebraic query plan graphs that can include verbatim XML data, references to resource locations (URLs), and abstract resource names (URNs). We show how we can build distributed catalogs based on multi-hierarchic namespaces that can efficiently handle content indexing and query routing. We also discuss how peers can convey the currency and coverage of their data, and how queries can use this information to manage the inherent tradeoffs between answer completeness, timeliness, and latency.
@inproceedings {DBLP:conf/cidr/PapadimosM03, author = {Vassilis Papadimos and David Maier and Kristin Tufte}, booktitle = {CIDR}, title = {Distributed Query Processing and Catalogs for Peer-to-Peer Systems.}, year = {2003}, url = {db/conf/cidr/cidr2003.html#PapadimosM03}, ee = {http://www-db.cs.wisc.edu/cidr/program/p12.pdf}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
