DSpace Repository

CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing

Show simple item record

dc.creator Ng, Wee Siong
dc.creator Shu, Yanfeng
dc.creator Tok, Wee Hyong
dc.date 2003-12-13T19:03:28Z
dc.date 2003-12-13T19:03:28Z
dc.date 2004-01
dc.date.accessioned 2013-10-09T02:32:50Z
dc.date.available 2013-10-09T02:32:50Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/3855
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description 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.
dc.description Singapore-MIT Alliance (SMA)
dc.format 86440 bytes
dc.format application/pdf
dc.language en_US
dc.relation Computer Science (CS);
dc.subject CQ-Buddy
dc.subject continuous queries
dc.subject CQ
dc.subject P2P
dc.subject peer-to-peer
dc.subject distributed
dc.title CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing
dc.type Article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account