Abstract
In this paper, we propose CoCACHE, a P2P query processing architecture that enables sophisticated optimization techniques. Co-CACHE is different from existing P2P query processing systems in three ways. First, a coordinator overlay network (CON) maintaining the summary of the whole system is constructed by applying DHT technique to query plan trees. CON protocol ensures the efficiency for handling dynamic environments. Second, a preliminary cost-based optimization technique for retrieving appropriate cached copies of data is studied. With the help of CON, we show the possibility of fine optimization in even large scale and dynamic environments. Third, the collaborative caching strategy is presented, with which even small portion of cache storage on each peer may result in great improvement on query processing performance. Extensive experiments over real-world and synthetic settings show the effectiveness and efficiency of CoCACHE.
| Original language | English |
|---|---|
| Pages (from-to) | 498-510 |
| Number of pages | 13 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3453 |
| DOIs | |
| State | Published - 2005 |
| Externally published | Yes |
| Event | 10th International Conference on Database Systems for Advanced Applications, DASFAA 2005 - Beijing, China Duration: 17 Apr 2005 → 20 Apr 2005 |
Fingerprint
Dive into the research topics of 'CoCACHE: Query processing based on collaborative caching in P2P systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver