MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Computer Science (CS)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Computer Science (CS)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing

Author(s)
Ng, Wee Siong; Shu, Yanfeng; Tok, Wee Hyong
Thumbnail
DownloadCS007.pdf (84.41Kb)
Metadata
Show full item record
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.
Date issued
2004-01
URI
http://hdl.handle.net/1721.1/3855
Series/Report no.
Computer Science (CS);
Keywords
CQ-Buddy, continuous queries, CQ, P2P, peer-to-peer, distributed

Collections
  • Computer Science (CS)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.