Processing and Optimization of Complex Queries in Schema-Based P2P-Networks

Hadhami Dhraief, Alfons Kemper, Wolfgang Nejdl, Christian WiesnerDBISP2P 2004 · OpenReview

Abstract

Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networks which tackle efficient query distribution to a large set of peers but assume that each query can be answered completely at each peer. For queries which need data from more than one peer to be executed this is clearly insufficient. Unfortunately, though quite a few database techniques can be re-used in the P2P context, P2P data management infrastructures pose additional challenges caused by the dynamic nature of these networks. In P2P networks, we can assume neither global knowledge about data distribution, nor the suitableness of static topologies and static query plans for these networks. Unlike in traditional distributed database systems, we cannot assume complete information schema and allocation schema instances but rather work with distributed schema information which can only direct query processing tasks from one node to one or more neighboring nodes.
BibTeX
@inproceedings{dhraief2004processing,
  author = {Hadhami Dhraief and Alfons Kemper and Wolfgang Nejdl and Christian Wiesner},
  title = {{Processing and Optimization of Complex Queries in Schema-Based P2P-Networks}},
  booktitle = {DBISP2P},
  year = {2004},
  url = {https://openreview.net/forum?id=QgBng7ICyh},
}

Loading related content...

Figure