You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@beam.apache.org by dh...@apache.org on 2016/09/28 20:37:34 UTC

[3/3] incubator-beam-site git commit: Regenerated html.

Regenerated html.


Project: http://git-wip-us.apache.org/repos/asf/incubator-beam-site/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-beam-site/commit/976b0302
Tree: http://git-wip-us.apache.org/repos/asf/incubator-beam-site/tree/976b0302
Diff: http://git-wip-us.apache.org/repos/asf/incubator-beam-site/diff/976b0302

Branch: refs/heads/asf-site
Commit: 976b0302ab2fdd39dde60839ebc6b5a6a72bc0f7
Parents: 13f6231
Author: Dan Halperin <dh...@google.com>
Authored: Wed Sep 28 13:37:13 2016 -0700
Committer: Dan Halperin <dh...@google.com>
Committed: Wed Sep 28 13:37:13 2016 -0700

----------------------------------------------------------------------
 content/feed.xml                                   | 4 ++--
 content/learn/programming-guide/index.html         | 2 +-
 content/learn/runners/capability-matrix/index.html | 2 +-
 3 files changed, 4 insertions(+), 4 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/incubator-beam-site/blob/976b0302/content/feed.xml
----------------------------------------------------------------------
diff --git a/content/feed.xml b/content/feed.xml
index 8169dce..ee37eb9 100644
--- a/content/feed.xml
+++ b/content/feed.xml
@@ -6,8 +6,8 @@
 </description>
     <link>http://beam.incubator.apache.org/</link>
     <atom:link href="http://beam.incubator.apache.org/feed.xml" rel="self" type="application/rss+xml"/>
-    <pubDate>Mon, 26 Sep 2016 20:54:50 -0700</pubDate>
-    <lastBuildDate>Mon, 26 Sep 2016 20:54:50 -0700</lastBuildDate>
+    <pubDate>Wed, 28 Sep 2016 13:36:18 -0700</pubDate>
+    <lastBuildDate>Wed, 28 Sep 2016 13:36:18 -0700</lastBuildDate>
     <generator>Jekyll v3.2.0</generator>
     
       <item>

http://git-wip-us.apache.org/repos/asf/incubator-beam-site/blob/976b0302/content/learn/programming-guide/index.html
----------------------------------------------------------------------
diff --git a/content/learn/programming-guide/index.html b/content/learn/programming-guide/index.html
index efe6cb9..f78bb68 100644
--- a/content/learn/programming-guide/index.html
+++ b/content/learn/programming-guide/index.html
@@ -313,7 +313,7 @@
 
 <p>A <code class="highlighter-rouge">PCollection</code> can be either <strong>bounded</strong> or <strong>unbounded</strong> in size. A <strong>bounded</strong> <code class="highlighter-rouge">PCollection</code> represents a data set of a known, fixed size, while an <strong>unbounded</strong> <code class="highlighter-rouge">PCollection</code> represents a data set of unlimited size. Whether a <code class="highlighter-rouge">PCollection</code> is bounded or unbounded depends on the source of the data set that it represents. Reading from a batch data source, such as a file or a database, creates a bounded <code class="highlighter-rouge">PCollection</code>. Reading from a streaming or continously-updating data source, such as Pub/Sub or Kafka, creates an unbounded <code class="highlighter-rouge">PCollection</code> (unless you explicitly tell it not to).</p>
 
-<p>The bounded (or unbounded) nature The bounded (or unbounded) nature of your <code class="highlighter-rouge">PCollection</code> affects how Beam processes your data. A bounded <code class="highlighter-rouge">PCollection</code> can be processed using a batch job, which might read the entire data set once, and perform processing in a job of finite length. An unbounded <code class="highlighter-rouge">PCollection</code> must be processed using a streaming job that runs continuously, as the entire collection can never be available for processing at any one time.</p>
+<p>The bounded (or unbounded) nature of your <code class="highlighter-rouge">PCollection</code> affects how Beam processes your data. A bounded <code class="highlighter-rouge">PCollection</code> can be processed using a batch job, which might read the entire data set once, and perform processing in a job of finite length. An unbounded <code class="highlighter-rouge">PCollection</code> must be processed using a streaming job that runs continuously, as the entire collection can never be available for processing at any one time.</p>
 
 <p>When performing an operation that groups elements in an unbounded <code class="highlighter-rouge">PCollection</code>, Beam requires a concept called <strong>Windowing</strong> to divide a continuously updating data set into logical windows of finite size.  Beam processes each window as a bundle, and processing continues as the data set is generated. These logical windows are determined by some characteristic associated with a data element, such as a <strong>timestamp</strong>.</p>
 

http://git-wip-us.apache.org/repos/asf/incubator-beam-site/blob/976b0302/content/learn/runners/capability-matrix/index.html
----------------------------------------------------------------------
diff --git a/content/learn/runners/capability-matrix/index.html b/content/learn/runners/capability-matrix/index.html
index 832b8ef..9259c30 100644
--- a/content/learn/runners/capability-matrix/index.html
+++ b/content/learn/runners/capability-matrix/index.html
@@ -141,7 +141,7 @@
 
       <div class="row">
         <h1 id="beam-capability-matrix">Beam Capability Matrix</h1>
-<p><span style="font-size:11px;float:none">Last updated: 2016-09-26 20:54 PDT</span></p>
+<p><span style="font-size:11px;float:none">Last updated: 2016-09-28 13:36 PDT</span></p>
 
 <p>Apache Beam (incubating) provides a portable API layer for building sophisticated data-parallel processing engines that may be executed across a diversity of exeuction engines, or <i>runners</i>. The core concepts of this layer are based upon the Beam Model (formerly referred to as the <a href="http://www.vldb.org/pvldb/vol8/p1792-Akidau.pdf">Dataflow Model</a>), and implemented to varying degrees in each Beam runner. To help clarify the capabilities of individual runners, we\u2019ve created the capability matrix below.</p>