<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Search on 111qqz的小窝</title><link>https://111qqz.com/tags/search/</link><description>Recent content in Search on 111qqz的小窝</description><generator>Hugo -- gohugo.io</generator><language>zh-cn</language><managingEditor>hust.111qqz@gmail.com (111qqz)</managingEditor><webMaster>hust.111qqz@gmail.com (111qqz)</webMaster><copyright>© 2011-2026 111qqz</copyright><lastBuildDate>Thu, 17 Sep 2026 23:30:00 +0800</lastBuildDate><atom:link href="https://111qqz.com/tags/search/index.xml" rel="self" type="application/rss+xml"/><item><title>从倒排索引到 BPE：高性能系统为什么总在避免扫描全集</title><link>https://111qqz.com/2026/09/avoid-global-scan-in-systems/</link><pubDate>Thu, 17 Sep 2026 23:30:00 +0800</pubDate><author>hust.111qqz@gmail.com (111qqz)</author><guid>https://111qqz.com/2026/09/avoid-global-scan-in-systems/</guid><description>&lt;p&gt;最近在系统学习 Search 和 Information Retrieval 的知识。在看倒排索引（Inverted Index）的时候，我越看越觉得这个结构非常眼熟。直到我想起前段时间写 CS336 作业里 BPE（Byte-Pair Encoding）分词算法的优化逻辑，我才突然意识到：原来这些看似完全不同领域的系统，底层其实都在共享同一种 pattern。&lt;/p&gt;</description></item></channel></rss>