Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3855
Full metadata record
DC FieldValueLanguage
dc.creatorNg, Wee Siong-
dc.creatorShu, Yanfeng-
dc.creatorTok, Wee Hyong-
dc.date2003-12-13T19:03:28Z-
dc.date2003-12-13T19:03:28Z-
dc.date2004-01-
dc.date.accessioned2013-10-09T02:32:50Z-
dc.date.available2013-10-09T02:32:50Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/3855-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionIn 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.descriptionSingapore-MIT Alliance (SMA)-
dc.format86440 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationComputer Science (CS);-
dc.subjectCQ-Buddy-
dc.subjectcontinuous queries-
dc.subjectCQ-
dc.subjectP2P-
dc.subjectpeer-to-peer-
dc.subjectdistributed-
dc.titleCQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing-
dc.typeArticle-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.