<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>概念科普 on 影神图</title><link>https://jiangxt2.github.io/concepts/</link><description>Recent content in 概念科普 on 影神图</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Thu, 17 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jiangxt2.github.io/concepts/index.xml" rel="self" type="application/rss+xml"/><item><title>Shuffle 是什么</title><link>https://jiangxt2.github.io/concepts/shuffle/</link><pubDate>Thu, 17 Sep 2026 00:00:00 +0000</pubDate><guid>https://jiangxt2.github.io/concepts/shuffle/</guid><description>解释分布式计算为什么需要重新分布数据，以及 Shuffle 的成本从哪里来。</description></item><item><title>什么是向量化执行</title><link>https://jiangxt2.github.io/concepts/vectorized-execution/</link><pubDate>Thu, 17 Sep 2026 00:00:00 +0000</pubDate><guid>https://jiangxt2.github.io/concepts/vectorized-execution/</guid><description>用批量处理而不是逐行处理理解向量化执行，以及它为什么常出现在 OLAP 系统中。</description></item><item><title>行式存储与列式存储</title><link>https://jiangxt2.github.io/concepts/columnar-storage/</link><pubDate>Thu, 17 Sep 2026 00:00:00 +0000</pubDate><guid>https://jiangxt2.github.io/concepts/columnar-storage/</guid><description>从访问模式、压缩、扫描和写入代价理解行式与列式存储。</description></item></channel></rss>