Author: hsaputra
Date: Wed Mar 18 17:22:41 2015
New Revision: 1667594
URL: http://svn.apache.org/r1667594
Log:
Fix the position for images of the joins options in Flink for the internal
Flink blog post.
Modified:
flink/_posts/2015-03-13-peeking-into-Apache-Flinks-Engine-Room.md
flink/site/blog/feed.xml
flink/site/blog/index.html
flink/site/news/2015/03/13/peeking-into-Apache-Flinks-Engine-Room.html
Modified: flink/_posts/2015-03-13-peeking-into-Apache-Flinks-Engine-Room.md
URL:
http://svn.apache.org/viewvc/flink/_posts/2015-03-13-peeking-into-Apache-Flinks-Engine-Room.md?rev=1667594&r1=1667593&r2=1667594&view=diff
==============================================================================
--- flink/_posts/2015-03-13-peeking-into-Apache-Flinks-Engine-Room.md (original)
+++ flink/_posts/2015-03-13-peeking-into-Apache-Flinks-Engine-Room.md Wed Mar
18 17:22:41 2015
@@ -72,13 +72,13 @@ Flink features two ship strategies to es
The Repartition-Repartition strategy partitions both inputs, R and S, on their
join key attributes using the same partitioning function. Each partition is
assigned to exactly one parallel join instance and all data of that partition
is sent to its associated instance. This ensures that all elements that share
the same join key are shipped to the same parallel instance and can be locally
joined. The cost of the RR strategy is a full shuffle of both data sets over
the network.
<center>
-<img src="{{ site.baseurl }}/img/blog/joins-broadcast.png"
style="width:90%;margin:15px">
+<img src="{{ site.baseurl }}/img/blog/joins-repartition.png"
style="width:90%;margin:15px">
</center>
The Broadcast-Forward strategy sends one complete data set (R) to each
parallel instance that holds a partition of the other data set (S), i.e., each
parallel instance receives the full data set R. Data set S remains local and is
not shipped at all. The cost of the BF strategy depends on the size of R and
the number of parallel instances it is shipped to. The size of S does not
matter because S is not moved. The figure below illustrates how both ship
strategies work.
<center>
-<img src="{{ site.baseurl }}/img/blog/joins-repartition.png"
style="width:90%;margin:15px">
+<img src="{{ site.baseurl }}/img/blog/joins-broadcast.png"
style="width:90%;margin:15px">
</center>
The Repartition-Repartition and Broadcast-Forward ship strategies establish
suitable data distributions to execute a distributed join. Depending on the
operations that are applied before the join, one or even both inputs of a join
are already distributed in a suitable way across parallel instances. In this
case, Flink will reuse such distributions and only ship one or no input at all.
@@ -175,4 +175,4 @@ We have seen that off-the-shelf distribu
<br>
-<small>Written by Fabian Hueske
([@fhueske](https://twitter.com/fhueske)).</small>
\ No newline at end of file
+<small>Written by Fabian Hueske
([@fhueske](https://twitter.com/fhueske)).</small>
Modified: flink/site/blog/feed.xml
URL:
http://svn.apache.org/viewvc/flink/site/blog/feed.xml?rev=1667594&r1=1667593&r2=1667594&view=diff
==============================================================================
Binary files - no diff available.
Modified: flink/site/blog/index.html
URL:
http://svn.apache.org/viewvc/flink/site/blog/index.html?rev=1667594&r1=1667593&r2=1667594&view=diff
==============================================================================
--- flink/site/blog/index.html (original)
+++ flink/site/blog/index.html Wed Mar 18 17:22:41 2015
@@ -208,13 +208,13 @@
<p>The Repartition-Repartition strategy partitions both inputs, R and S, on
their join key attributes using the same partitioning function. Each partition
is assigned to exactly one parallel join instance and all data of that
partition is sent to its associated instance. This ensures that all elements
that share the same join key are shipped to the same parallel instance and can
be locally joined. The cost of the RR strategy is a full shuffle of both data
sets over the network.</p>
<p><center>
-<img src="/img/blog/joins-broadcast.png" style="width:90%;margin:15px">
+<img src="/img/blog/joins-repartition.png" style="width:90%;margin:15px">
</center></p>
<p>The Broadcast-Forward strategy sends one complete data set (R) to each
parallel instance that holds a partition of the other data set (S), i.e., each
parallel instance receives the full data set R. Data set S remains local and is
not shipped at all. The cost of the BF strategy depends on the size of R and
the number of parallel instances it is shipped to. The size of S does not
matter because S is not moved. The figure below illustrates how both ship
strategies work. </p>
<p><center>
-<img src="/img/blog/joins-repartition.png" style="width:90%;margin:15px">
+<img src="/img/blog/joins-broadcast.png" style="width:90%;margin:15px">
</center></p>
<p>The Repartition-Repartition and Broadcast-Forward ship strategies establish
suitable data distributions to execute a distributed join. Depending on the
operations that are applied before the join, one or even both inputs of a join
are already distributed in a suitable way across parallel instances. In this
case, Flink will reuse such distributions and only ship one or no input at
all.</p>
Modified: flink/site/news/2015/03/13/peeking-into-Apache-Flinks-Engine-Room.html
URL:
http://svn.apache.org/viewvc/flink/site/news/2015/03/13/peeking-into-Apache-Flinks-Engine-Room.html?rev=1667594&r1=1667593&r2=1667594&view=diff
==============================================================================
--- flink/site/news/2015/03/13/peeking-into-Apache-Flinks-Engine-Room.html
(original)
+++ flink/site/news/2015/03/13/peeking-into-Apache-Flinks-Engine-Room.html Wed
Mar 18 17:22:41 2015
@@ -207,13 +207,13 @@
<p>The Repartition-Repartition strategy partitions both inputs, R and S, on
their join key attributes using the same partitioning function. Each partition
is assigned to exactly one parallel join instance and all data of that
partition is sent to its associated instance. This ensures that all elements
that share the same join key are shipped to the same parallel instance and can
be locally joined. The cost of the RR strategy is a full shuffle of both data
sets over the network.</p>
<p><center>
-<img src="/img/blog/joins-broadcast.png" style="width:90%;margin:15px">
+<img src="/img/blog/joins-repartition.png" style="width:90%;margin:15px">
</center></p>
<p>The Broadcast-Forward strategy sends one complete data set (R) to each
parallel instance that holds a partition of the other data set (S), i.e., each
parallel instance receives the full data set R. Data set S remains local and is
not shipped at all. The cost of the BF strategy depends on the size of R and
the number of parallel instances it is shipped to. The size of S does not
matter because S is not moved. The figure below illustrates how both ship
strategies work. </p>
<p><center>
-<img src="/img/blog/joins-repartition.png" style="width:90%;margin:15px">
+<img src="/img/blog/joins-broadcast.png" style="width:90%;margin:15px">
</center></p>
<p>The Repartition-Repartition and Broadcast-Forward ship strategies establish
suitable data distributions to execute a distributed join. Depending on the
operations that are applied before the join, one or even both inputs of a join
are already distributed in a suitable way across parallel instances. In this
case, Flink will reuse such distributions and only ship one or no input at
all.</p>
