Please use this identifier to cite or link to this item:
|Title:||PMJoin: Optimizing distributed multi-way stream joins by stream partitioning||Authors:||Zhou, Y.
|Issue Date:||2006||Citation:||Zhou, Y., Yan, Y., Yu, F., Zhou, A. (2006). PMJoin: Optimizing distributed multi-way stream joins by stream partitioning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3882 LNCS : 325-341. ScholarBank@NUS Repository.||Abstract:||In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communication cost. As queries run continuously, the precious bandwidths would be aggressively consumed without careful optimization of operator ordering and placement. In this paper, we focus on the optimization of continuous multi-join queries over distributed streams. We observe that by partitioning streams into sub-streams we can significantly reduce the communication cost and hence propose a novel partition-based join scheme - PM Join. A few partitioning techniques are studied. To generate the query plan for each substream, a heuristic algorithm is proposed based on a rate-based model. Results from an extensive experimental study show that our techniques can sufficiently reduce the communication cost. © Springer-Verlag Berlin Heidelberg 2006.||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/132901||ISBN:||3540333371||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 10, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.