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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Qian, W., Xu, L., Zhou, S., & Zhou, A. (2005). CoCACHE: Query processing based on collaborative caching in P2P systems. In Lecture Notes in Computer Science (Vol. 3453, pp. 498–510). Springer Verlag. https://doi.org/10.1007/11408079_44
Mendeley helps you to discover research relevant for your work.