CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing
Author(s)
Ng, Wee Siong
Shu, Yanfeng
Tok, Wee Hyong
Date Issued
January 2004
Series/Report no.
Computer Science (CS);
Abstract
In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities (processing and memory) of peers and load-balances the tasks across powerful and weak peers. Our main contributions are as follows: First, CQ-Buddy introduces the notion of pervasive continuous queries to tackle the frequent disconnected problems common in a peer-to-peer environment. Second, CQ-Buddy allows for inter-sharing and intra-sharing in the processing of continuous queries amongst peers. Third, CQ-Buddy peers perform query-centric load balancing for overloaded data source providers by acting as proxies. We have conducted extensive studies to evaluate CQ-Buddy’s performance. Our results show that CQ-Buddy is highly scalable, and is able to process continuous queries in an effective and efficient manner.
Subjects
CQ-Buddy
continuous queries
CQ
P2P
peer-to-peer
distributed
Persistent DSpace Link
