Please use this identifier to cite or link to this item:
|Title:||Toward massive query optimization in large-scale distributed stream systems||Authors:||Zhou, Y.
|Keywords:||Distributed stream systems
|Issue Date:||2008||Citation:||Zhou, Y.,Aberer, K.,Tan, K.-L. (2008). Toward massive query optimization in large-scale distributed stream systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5346 LNCS : 326-345. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-89856-6_17||Abstract:||Existing distributed stream systems adopt a tightly-coupled communication paradigm and focus on fine-tuning of operator placements to achieve communication efficiency. This kind of approach is hard to scale (both to the nodes in the network and the users). In this paper, we propose a fundamentally different approach and present the design of a middleware for optimizing massive queries. Our approach takes the advantages of existing Publish/Subscribe systems (Pub/Sub) to achieve loosely-coupled communication and to "intelligently" exploit the sharing of communication among different queries. To fully exploit the capability of a Pub/Sub, we present a new query distribution algorithm, which can adaptively and rapidly (re)distribute the streaming queries at runtime to achieve both load balancing and low communication cost. Both the simulation studies and the prototype experiments executed on PlanetLab show the effectiveness of our techniques. © 2008 Springer Berlin Heidelberg.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/40797||ISBN:||3540898557||ISSN:||03029743||DOI:||10.1007/978-3-540-89856-6_17|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 14, 2019
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.