理解RDD的reduceByKey与groupByKey

数据准备

val words = Array("a","a","b","c","c")
val conf = new SparkConf().setAppName("word-count").setMaster("local");
val sc = new SparkContext(conf)
val rdd = sc.parallelize(words)

reduceByKey方法

rdd.map((_,1)).reduceByKey(_+_).collect().foreach(println)

groupByKey方法

rdd.map((_,1)).groupByKey().map(word => (word._1, word._2.sum)).collect().foreach(println)

输出结果是一致的,我们查看API文档发现有如下描述,

reduceByKey
Merge the values for each key using an associative and commutative reduce function. This will also perform the merging locally on each mapper before sending results to a reducer, similarly to a "combiner" in MapReduce. Output will be hash-partitioned with the existing partitioner/ parallelism level.

groupByKey()
Group the values for each key in the RDD into a single sequence. Hash-partitions the resulting RDD with the existing partitioner/parallelism level. The ordering of elements within each group is not guaranteed, and may even differ each time the resulting RDD is evaluated.

根据对比,我们发现reduceByKey方法在向reducer发送数据之前会先将数据按key进行合并,而groupByKey方法是直接对计算的RDD结果进行分区。

假设我们的数据文件分布在两个节点上,那么

reduceByKey工作图解

groupByKey工作图解

 

  • 0
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值