<?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 Vonng</title><link>https://vonng.com/en/tags/gin/</link><description>Recent content in GIN on Vonng</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>rh@vonng.com (Ruohang Feng)</managingEditor><webMaster>rh@vonng.com (Ruohang Feng)</webMaster><copyright>© 2025 Ruohang Feng</copyright><lastBuildDate>Fri, 12 Apr 2019 00:00:00 +0000</lastBuildDate><atom:link href="https://vonng.com/en/tags/gin/index.xml" rel="self" type="application/rss+xml"/><item><title>O(n2) Complexity of GIN Search</title><link>https://vonng.com/en/pg/gin/</link><pubDate>Fri, 12 Apr 2019 00:00:00 +0000</pubDate><author>rh@vonng.com (Ruohang Feng)</author><guid>https://vonng.com/en/pg/gin/</guid><description>When GIN indexes are used to search with very long keyword lists, performance degrades significantly. This article explains why GIN index keyword search has O(n^2) time complexity.</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://vonng.com/pg/gin/featured.jpg"/></item></channel></rss>