Optimizing Multi-way Theta Join for Data Skew in Sub-second Stream Computing

Xiaopeng Fan, Xinchun Liu, Yang Wang, Youjun Wang, Jing Li
{"title":"Optimizing Multi-way Theta Join for Data Skew in Sub-second Stream Computing","authors":"Xiaopeng Fan, Xinchun Liu, Yang Wang, Youjun Wang, Jing Li","doi":"10.1109/ICPADS51040.2020.00068","DOIUrl":null,"url":null,"abstract":"In sub-second stream computing, the answer to a complex query usually depends on operations of aggregation or join on streams, especially multi-way theta join. Some attribute keys are not distributed uniformly, which is called the data intrinsic skew problem, such as taxi car plate in GPS trajectories and transaction records, or stock code in stock quotes and investment portfolios etc. In this paper, we define the concept of key redundancy for single stream as the degree of data intrinsic skew, and joint key redundancy for multi-way streams. We present an execution model for multi-way stream theta joins with a fine-grained cost model to evaluate its performance. We propose a solution named Group Join (GroJoin) to make use of key redundancy during transmission and execution in a cluster. GroJoin is adaptive to data intrinsic skew in the way that it depends on the grouping condition we find out, i.e., the selectivity of theta join results should be smaller than 25%. Experiments are carried out by our MS-Generator to produce multi-way streams, and the simulation results show that GroJoin can decrease at most 45% transmission overheads with different key redundancies and value-key proportionality coefficients, and reduce at most 70% query delay with different key distributions. We further implement GroJoin in Multi-Way Stream Theta Join by Spark Streaming. The experimental results demonstrate that there are about 40%∼50% join latency reduced after our optimization with a very small computation cost.","PeriodicalId":196548,"journal":{"name":"2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"14611 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS51040.2020.00068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In sub-second stream computing, the answer to a complex query usually depends on operations of aggregation or join on streams, especially multi-way theta join. Some attribute keys are not distributed uniformly, which is called the data intrinsic skew problem, such as taxi car plate in GPS trajectories and transaction records, or stock code in stock quotes and investment portfolios etc. In this paper, we define the concept of key redundancy for single stream as the degree of data intrinsic skew, and joint key redundancy for multi-way streams. We present an execution model for multi-way stream theta joins with a fine-grained cost model to evaluate its performance. We propose a solution named Group Join (GroJoin) to make use of key redundancy during transmission and execution in a cluster. GroJoin is adaptive to data intrinsic skew in the way that it depends on the grouping condition we find out, i.e., the selectivity of theta join results should be smaller than 25%. Experiments are carried out by our MS-Generator to produce multi-way streams, and the simulation results show that GroJoin can decrease at most 45% transmission overheads with different key redundancies and value-key proportionality coefficients, and reduce at most 70% query delay with different key distributions. We further implement GroJoin in Multi-Way Stream Theta Join by Spark Streaming. The experimental results demonstrate that there are about 40%∼50% join latency reduced after our optimization with a very small computation cost.
优化亚秒流计算中数据倾斜的多路Theta连接
在亚秒流计算中,复杂查询的答案通常依赖于流上的聚合或连接操作,特别是多路theta连接。某些属性键不均匀分布的问题称为数据固有偏态问题,如GPS轨迹和交易记录中的出租车车牌号,股票报价和投资组合中的股票代码等。本文将单流的密钥冗余定义为数据固有倾斜的程度,将多路流的联合密钥冗余定义为数据固有倾斜的程度。我们提出了一个多路流theta连接的执行模型和一个细粒度的成本模型来评估其性能。我们提出了一种名为Group Join (GroJoin)的解决方案,以利用集群中传输和执行过程中的密钥冗余。GroJoin对数据固有的倾斜是自适应的,它取决于我们发现的分组条件,也就是说,theta join结果的选择性应该小于25%。利用MS-Generator进行了多路流生成实验,仿真结果表明,在不同的键冗余度和值-键比例系数下,GroJoin最多可以减少45%的传输开销,在不同的键分布下,GroJoin最多可以减少70%的查询延迟。我们进一步实现GroJoin在多路流Theta加入Spark流。实验结果表明,优化后的连接延迟减少了40% ~ 50%,计算成本很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信