Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
An adaptive peer-to-peer network for distributed caching of OLAP results
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
BuddyWeb: A P2P-Based Collaborative Web Caching System
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
Mapping data in peer-to-peer systems: semantics and algorithmic issues
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
BestPeer: A Self-Configurable Peer-to-Peer System
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A catalog-based caching strategy for structured P2P systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
| Hi-index | 0.00 |
In this paper, we propose CoCache, a P2P query processing architecture that enables sophisticated optimization techniques. CoCache 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.