<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>GIN on 老冯云数</title><link>https://vonng.com/tags/gin/</link><description>Recent content in GIN on 老冯云数</description><generator>Hugo -- gohugo.io</generator><language>zh-cn</language><managingEditor>rh@vonng.com (冯若航)</managingEditor><webMaster>rh@vonng.com (冯若航)</webMaster><copyright>© 2025 冯若航</copyright><lastBuildDate>Fri, 12 Apr 2019 00:00:00 +0000</lastBuildDate><atom:link href="https://vonng.com/tags/gin/index.xml" rel="self" type="application/rss+xml"/><item><title>GIN搜索的O(n²)复杂度</title><link>https://vonng.com/pg/gin/</link><pubDate>Fri, 12 Apr 2019 00:00:00 +0000</pubDate><author>rh@vonng.com (冯若航)</author><guid>https://vonng.com/pg/gin/</guid><description>GIN索引如果使用很长的关键词列表进行搜索，会导致性能显著下降。本文解释了为什么GIN索引关键词搜索的时间复杂度为O(n²)。</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://vonng.com/pg/gin/featured.jpg"/></item></channel></rss>