You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@spark.apache.org by Vijayasarathy Kannan <kv...@vt.edu> on 2015/04/26 19:42:21 UTC
Complexity of transformations in Spark
What is the complexity of transformations and actions in Spark, such as
groupBy(), flatMap(), collect(), etc.?
What attributes do we need to factor (such as number of partitions) in
while analyzing codes using these operations?
Re: Complexity of transformations in Spark
Posted by Zoltán Zvara <zo...@gmail.com>.
You can calculate the complexity of these operators by looking at the
RDD.scala basically. There, you will find - for example - what happens when
you call a map on RDDs. It's a simple Scala map function on a simple
Iterator of type T. Distinct has been implemented with mapping and grouping
on the iterator as I resemble.
Zoltán
On Sun, Apr 26, 2015 at 7:43 PM Vijayasarathy Kannan <kv...@vt.edu> wrote:
> What is the complexity of transformations and actions in Spark, such as
> groupBy(), flatMap(), collect(), etc.?
>
> What attributes do we need to factor (such as number of partitions) in
> while analyzing codes using these operations?
>