Details
| Original language | English |
|---|---|
| Title of host publication | DBISP2P 2004 |
| Subtitle of host publication | Databases, Information Systems, and Peer-to-Peer Computing |
| Pages | 31-45 |
| Number of pages | 15 |
| ISBN (electronic) | 978-3-540-31838-5 |
| Publication status | Published - 2005 |
| Event | Second International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, DBISP2P 2004 - Toronto, Ont., Canada Duration: 29 Aug 2004 → 30 Aug 2004 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer Verlag |
| Volume | 3367 |
| ISSN (Print) | 0302-9743 |
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. In this paper we first describe briefly our super-peer based topology and schema-aware distributed routing indices extended with suitable statistics and describe how this information is extracted and updated. Second we show how these indices facilitate the distribution and dynamic expansion of query plans. Third we propose a set of transformation rules to optimize query plans and discuss different optimization strategies in detail, enabling efficient distributed query processing in a schema-based P2P network.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- General Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
DBISP2P 2004: Databases, Information Systems, and Peer-to-Peer Computing. 2005. p. 31-45 (Lecture Notes in Computer Science; Vol. 3367).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Processing and optimization of complex queries in schema-based P2P-networks
AU - Dhraief, Hadhami
AU - Kemper, Alfons
AU - Nejdl, Wolfgang
AU - Wiesner, Christian
PY - 2005
Y1 - 2005
N2 - 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. In this paper we first describe briefly our super-peer based topology and schema-aware distributed routing indices extended with suitable statistics and describe how this information is extracted and updated. Second we show how these indices facilitate the distribution and dynamic expansion of query plans. Third we propose a set of transformation rules to optimize query plans and discuss different optimization strategies in detail, enabling efficient distributed query processing in a schema-based P2P network.
AB - 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. In this paper we first describe briefly our super-peer based topology and schema-aware distributed routing indices extended with suitable statistics and describe how this information is extracted and updated. Second we show how these indices facilitate the distribution and dynamic expansion of query plans. Third we propose a set of transformation rules to optimize query plans and discuss different optimization strategies in detail, enabling efficient distributed query processing in a schema-based P2P network.
UR - http://www.scopus.com/inward/record.url?scp=24144454784&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-31838-5_3
DO - 10.1007/978-3-540-31838-5_3
M3 - Conference contribution
AN - SCOPUS:24144454784
SN - 978-3-540-25233-7
T3 - Lecture Notes in Computer Science
SP - 31
EP - 45
BT - DBISP2P 2004
T2 - Second International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, DBISP2P 2004
Y2 - 29 August 2004 through 30 August 2004
ER -