Show simple item record

dc.contributor.authorNg, Wee Siong
dc.contributor.authorShu, Yanfeng
dc.contributor.authorTok, Wee Hyong
dc.date.accessioned2003-12-13T19:03:28Z
dc.date.available2003-12-13T19:03:28Z
dc.date.issued2004-01
dc.identifier.urihttp://hdl.handle.net/1721.1/3855
dc.description.abstractIn 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.en
dc.description.sponsorshipSingapore-MIT Alliance (SMA)en
dc.format.extent86440 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesComputer Science (CS);
dc.subjectCQ-Buddyen
dc.subjectcontinuous queriesen
dc.subjectCQen
dc.subjectP2Pen
dc.subjectpeer-to-peeren
dc.subjectdistributeden
dc.titleCQ-Buddy: Harnessing Peers For Distributed Continuous Query Processingen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record