(datafusion-site) branch asf-staging updated: Commit build products

[github-bot]

This is an automated email from the ASF dual-hosted git repository.

github-actions[bot] pushed a commit to branch asf-staging
in repository https://gitbox.apache.org/repos/asf/datafusion-site.git


The following commit(s) were added to refs/heads/asf-staging by this push:
     new 870453f  Commit build products
870453f is described below

commit 870453ff15d4b4ce8c081d50d6560ae3d983d66f
Author: Build Pelican (action) <priv...@infra.apache.org>
AuthorDate: Fri Aug 7 19:57:50 2026 +0000

    Commit build products
---
 blog/2026/08/07/datafusion-comet-1.0.0/index.html | 2 +-
 blog/feeds/all-en.atom.xml                        | 2 +-
 blog/feeds/blog.atom.xml                          | 2 +-
 blog/feeds/pmc.atom.xml                           | 2 +-
 4 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/blog/2026/08/07/datafusion-comet-1.0.0/index.html 
b/blog/2026/08/07/datafusion-comet-1.0.0/index.html
index a666f7e..c1e7727 100644
--- a/blog/2026/08/07/datafusion-comet-1.0.0/index.html
+++ b/blog/2026/08/07/datafusion-comet-1.0.0/index.html
@@ -140,7 +140,7 @@ running natively. Four consequences are worth calling 
out.</p>
   semantics — regular expressions being the canonical case, given the gap 
between Java's regex engine and
   any Rust or C++ equivalent — codegen dispatch delivers bit-for-bit Spark 
parity because it <em>is</em> Spark's
   implementation.</li>
-<li><strong>Expression fusion.</strong> A dispatched expression tree is 
compiled into a single method, so the Arrow
+<li><strong>Expression fusion.</strong> A dispatched expression tree 
(<em>i.e.</em>, nested expressions) is compiled into a single method, so the 
Arrow
   input reads, the expression evaluation, and the Arrow output writes are 
fused together. The compiler
   is free to optimize across the whole tree, and no intermediate Arrow 
<code>RecordBatch</code> is materialized
   between one expression and the next.</li>
diff --git a/blog/feeds/all-en.atom.xml b/blog/feeds/all-en.atom.xml
index 522c75f..b984754 100644
--- a/blog/feeds/all-en.atom.xml
+++ b/blog/feeds/all-en.atom.xml
@@ -85,7 +85,7 @@ running natively. Four consequences are worth calling 
out.&lt;/p&gt;
   semantics — regular expressions being the canonical case, given the gap 
between Java's regex engine and
   any Rust or C++ equivalent — codegen dispatch delivers bit-for-bit Spark 
parity because it &lt;em&gt;is&lt;/em&gt; Spark's
   implementation.&lt;/li&gt;
-&lt;li&gt;&lt;strong&gt;Expression fusion.&lt;/strong&gt; A dispatched 
expression tree is compiled into a single method, so the Arrow
+&lt;li&gt;&lt;strong&gt;Expression fusion.&lt;/strong&gt; A dispatched 
expression tree (&lt;em&gt;i.e.&lt;/em&gt;, nested expressions) is compiled 
into a single method, so the Arrow
   input reads, the expression evaluation, and the Arrow output writes are 
fused together. The compiler
   is free to optimize across the whole tree, and no intermediate Arrow 
&lt;code&gt;RecordBatch&lt;/code&gt; is materialized
   between one expression and the next.&lt;/li&gt;
diff --git a/blog/feeds/blog.atom.xml b/blog/feeds/blog.atom.xml
index bf8dffe..a28f6fa 100644
--- a/blog/feeds/blog.atom.xml
+++ b/blog/feeds/blog.atom.xml
@@ -85,7 +85,7 @@ running natively. Four consequences are worth calling 
out.&lt;/p&gt;
   semantics — regular expressions being the canonical case, given the gap 
between Java's regex engine and
   any Rust or C++ equivalent — codegen dispatch delivers bit-for-bit Spark 
parity because it &lt;em&gt;is&lt;/em&gt; Spark's
   implementation.&lt;/li&gt;
-&lt;li&gt;&lt;strong&gt;Expression fusion.&lt;/strong&gt; A dispatched 
expression tree is compiled into a single method, so the Arrow
+&lt;li&gt;&lt;strong&gt;Expression fusion.&lt;/strong&gt; A dispatched 
expression tree (&lt;em&gt;i.e.&lt;/em&gt;, nested expressions) is compiled 
into a single method, so the Arrow
   input reads, the expression evaluation, and the Arrow output writes are 
fused together. The compiler
   is free to optimize across the whole tree, and no intermediate Arrow 
&lt;code&gt;RecordBatch&lt;/code&gt; is materialized
   between one expression and the next.&lt;/li&gt;
diff --git a/blog/feeds/pmc.atom.xml b/blog/feeds/pmc.atom.xml
index 849e212..19a8e2b 100644
--- a/blog/feeds/pmc.atom.xml
+++ b/blog/feeds/pmc.atom.xml
@@ -85,7 +85,7 @@ running natively. Four consequences are worth calling 
out.&lt;/p&gt;
   semantics — regular expressions being the canonical case, given the gap 
between Java's regex engine and
   any Rust or C++ equivalent — codegen dispatch delivers bit-for-bit Spark 
parity because it &lt;em&gt;is&lt;/em&gt; Spark's
   implementation.&lt;/li&gt;
-&lt;li&gt;&lt;strong&gt;Expression fusion.&lt;/strong&gt; A dispatched 
expression tree is compiled into a single method, so the Arrow
+&lt;li&gt;&lt;strong&gt;Expression fusion.&lt;/strong&gt; A dispatched 
expression tree (&lt;em&gt;i.e.&lt;/em&gt;, nested expressions) is compiled 
into a single method, so the Arrow
   input reads, the expression evaluation, and the Arrow output writes are 
fused together. The compiler
   is free to optimize across the whole tree, and no intermediate Arrow 
&lt;code&gt;RecordBatch&lt;/code&gt; is materialized
   between one expression and the next.&lt;/li&gt;


---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscr...@datafusion.apache.org
For additional commands, e-mail: commits-h...@datafusion.apache.org