<story><title>Using the linear distance operator in Postgres 12 to find the closest match</title><url>https://www.2ndquadrant.com/en/blog/postgresql-12-implementing-k-nearest-neighbor-space-partitioned-generalized-search-tree-indexes/</url></story><parent_chain></parent_chain><comment><author>miles-po</author><text>While the unindexed time is impressive for the lack of index, the GIST and SP-GIST times are not 0.939 sec and 0.358 sec. All times are in &lt;i&gt;milliseconds&lt;/i&gt;. GIST returns in slightly less than 1ms, not 1s. SP-GIST returns in slightly more than 1&amp;#x2F;3 of a millisecond.&lt;p&gt;Performance for GIST and SP-GIST are in fact three orders of magnitude better than what the author summarized!</text></comment>
<story><title>Using the linear distance operator in Postgres 12 to find the closest match</title><url>https://www.2ndquadrant.com/en/blog/postgresql-12-implementing-k-nearest-neighbor-space-partitioned-generalized-search-tree-indexes/</url></story><parent_chain></parent_chain><comment><author>zRedShift</author><text>So it&amp;#x27;s using a K-D-B-Tree under the hood? SP-GiST, that is.&lt;p&gt;&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;en.wikipedia.org&amp;#x2F;wiki&amp;#x2F;K-D-B-tree&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;en.wikipedia.org&amp;#x2F;wiki&amp;#x2F;K-D-B-tree&lt;/a&gt;</text></comment>