<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Vector-Indexing on Leonardo Kuffo</title>
    <link>https://www.lkuffo.com/tags/vector-indexing/</link>
    <description>Recent content in Vector-Indexing on Leonardo Kuffo</description>
    <image>
      <title>Leonardo Kuffo</title>
      <url>https://www.lkuffo.com/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</url>
      <link>https://www.lkuffo.com/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</link>
    </image>
    <generator>Hugo -- 0.147.7</generator>
    <language>en-us</language>
    <lastBuildDate>Thu, 19 Feb 2026 12:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.lkuffo.com/tags/vector-indexing/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Indexing 10M vector embeddings in 1 minute on a single CPU</title>
      <link>https://www.lkuffo.com/superkmeans/</link>
      <pubDate>Thu, 19 Feb 2026 12:00:00 +0000</pubDate>
      <guid>https://www.lkuffo.com/superkmeans/</guid>
      <description>&lt;p&gt;Indexing large vector embedding collections remains a pain point when setting up vector search infrastructures. Indexes like HNSW or IVF can take hours or even days to construct.&lt;/p&gt;
&lt;p&gt;To tackle this issue, we have developed and open-sourced &lt;a href=&#34;https://github.com/cwida/SuperKMeans&#34;&gt;SuperKMeans&lt;/a&gt;, a super-fast clustering library for high-dimensional vector embeddings that drastically reduces indexing time from hours to mere seconds. In this blog post, I will show how SuperKMeans can index 10 million 1024-dimensional vector embeddings in just 1 minute on a single CPU. Additionally, I will explain the secret sauce behind SuperKMeans&amp;rsquo;s extremely fast clustering performance.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
