<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>release on Vchord</title>
    <link>https://vchord.pgsty.com/tags/release/</link>
    <description>Recent content in release on Vchord</description>
    <generator>Hugo</generator>
    <language>en-US</language>
    
    
    
      <lastBuildDate>Mon, 02 Nov 2026 19:35:19 +0800</lastBuildDate>
    
    
      <atom:link href="https://vchord.pgsty.com/tags/release/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
        <title>VectorChord 1.1: Native 4/8 Bit Vector Types and Per-Index Query Defaults</title>
        <link>https://vchord.pgsty.com/blog/release/vectorchord-11-native-48-bit-vector-types-and-per-index-query-defaults/</link>
        <pubDate>Sat, 14 Feb 2026 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/vectorchord-11-native-48-bit-vector-types-and-per-index-query-defaults/</guid>
        <description>&lt;p&gt;We’re excited to announce the release of VectorChord 1.1 as we kick off the new year of horse.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&#34;https://vchord.pgsty.com/blog/release/vectorchord-10-developer-first-vector-search-on-postgres-100x-faster-indexing-than-pgvector/&#34;&gt;VectorChord 1.0&lt;/a&gt; was a milestone for Postgres-native vector search: it made large-scale indexing fast enough to feel like iteration, not an outage. In 1.1, we’re building on that foundation with RaBitQ8: A new vector type that delivers 4x storage savings and faster search speeds compared to float32, all with less than 1% recall loss. Paired with RaBitQ4 and more composable query control, VectorChord 1.1 is ready for your most demanding production workloads.&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord 1.0: Developer-First Vector Search on Postgres, 100x Faster Indexing than pgvector</title>
        <link>https://vchord.pgsty.com/blog/release/vectorchord-10-developer-first-vector-search-on-postgres-100x-faster-indexing-than-pgvector/</link>
        <pubDate>Thu, 04 Dec 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/vectorchord-10-developer-first-vector-search-on-postgres-100x-faster-indexing-than-pgvector/</guid>
        <description>&lt;p&gt;Two years ago, when we published the very first &lt;a href=&#34;https://github.com/tensorchord/pgvecto.rs&#34;&gt;pgvecto.rs&lt;/a&gt; blog post, we made a bet: &lt;strong&gt;Postgres is the best place to do vector search&lt;/strong&gt;. Since then we’ve been iterating on that bet — from VBASE with filtered vector search, to longer vector support, to the RaBitQ quantization scheme and disk‑friendly index layouts.&lt;/p&gt;&#xA;&lt;p&gt;With VectorChord 1.0 we’re moving the needle again. On a 16 vCPU machine, we can now build an index over 100M vectors in under 20 minutes. On the same scale, pgvector needs more than 50 hours. That number sounds impressive, but the point of this release isn’t just to win a benchmark slide. It’s to make your &lt;strong&gt;actual&lt;/strong&gt; development and iteration loop much faster.&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord 0.5: New RaBitQ-empowered DiskANN Index and Continuous Recall Measurement</title>
        <link>https://vchord.pgsty.com/blog/release/vectorchord-05-new-rabitq-empowered-diskann-index-and-continuous-recall-measurement/</link>
        <pubDate>Fri, 26 Sep 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/vectorchord-05-new-rabitq-empowered-diskann-index-and-continuous-recall-measurement/</guid>
        <description>&lt;p&gt;We&amp;rsquo;re thrilled to announce the release of &lt;strong&gt;VectorChord 0.5&lt;/strong&gt;! This release marks a significant step forward in our mission to provide more flexible, powerful, and controllable vector search capabilities. In the 0.5 release, we&amp;rsquo;re introducing two major updates: &lt;strong&gt;experimental support for the DiskANN graph index&lt;/strong&gt; and a new &lt;strong&gt;recall measurement tool to monitor the health of your IVF+RaBitQ indexes proactively&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2 id=&#34;new-index-preview-rabitq-empowered-diskann-index&#34;&gt;New Index Preview: RaBitQ-empowered DiskANN Index&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;From day one, VectorChord&amp;rsquo;s core indexing solution has relied on a powerful combination: the cluster-based IVF algorithm and RaBitQ quantization—what we ship as &lt;strong&gt;vchordrq (IVF+RaBitQ)&lt;/strong&gt;. This approach consistently delivers excellent low-latency, high-recall performance across a wide range of use cases and remains &lt;strong&gt;our recommended default&lt;/strong&gt; for most scenarios.&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord 0.4: Faster PostgreSQL Vector Search with Advanced I/O and Prefiltering</title>
        <link>https://vchord.pgsty.com/blog/release/vectorchord-04-faster-postgresql-vector-search-with-advanced-io-and-prefiltering/</link>
        <pubDate>Thu, 05 Jun 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/vectorchord-04-faster-postgresql-vector-search-with-advanced-io-and-prefiltering/</guid>
        <description>&lt;p&gt;We&amp;rsquo;re excited to announce the release of &lt;strong&gt;VectorChord 0.4&lt;/strong&gt;, a significant update that enhances high-performance vector search within PostgreSQL. We believe this release pushes the boundaries of what&amp;rsquo;s possible for vector search in PostgreSQL, introducing key architectural improvements designed to lower latency and increase throughput for demanding, real-world workloads.&lt;/p&gt;&#xA;&lt;p&gt;If you&amp;rsquo;re working with similarity searches, RAG pipelines, or other AI-driven applications on PostgreSQL, these updates are for you. We&amp;rsquo;ve focused on two major areas: significantly enhancing I/O for cold queries by leveraging PostgreSQL&amp;rsquo;s evolving capabilities, and optimizing filtered vector searches.&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord 0.3: Bringing Efficient Multi-Vector Contextual Late Interaction in PostgreSQL</title>
        <link>https://vchord.pgsty.com/blog/release/vectorchord-03-bringing-efficient-multi-vector-contextual-late-interaction-in-postgresql/</link>
        <pubDate>Sun, 13 Apr 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/vectorchord-03-bringing-efficient-multi-vector-contextual-late-interaction-in-postgresql/</guid>
        <description>&lt;p&gt;We&amp;rsquo;re thrilled to announce the release of &lt;strong&gt;VectorChord 0.3&lt;/strong&gt;, a major milestone that significantly boosts the performance and applicability of advanced vector search techniques directly within your Postgres database! Building on our 0.2 release, which brought ARM support and faster indexing, version 0.3 tackles one of the biggest hurdles in modern retrieval: &lt;strong&gt;efficient multi-vector search with late interaction&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h3 id=&#34;beyond-single-vectors-why-multi-vector-rocks&#34;&gt;Beyond Single Vectors: Why Multi-Vector Rocks&#xA;&lt;/h3&gt;&#xA;&lt;p&gt;For years, vector search primarily represented entire documents or queries as single, dense vectors. While powerful, this approach involves averaging or compressing complex information into one representation, inevitably leading to a loss of nuance. Imagine trying to capture the entire meaning of a detailed technical document in a single sentence – you&amp;rsquo;d lose specifics!&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord 0.2: 60K-Dimensional Vectors, 50% Faster Indexing with ARM</title>
        <link>https://vchord.pgsty.com/blog/release/vectorchord-02-60k-dimensional-vectors-50-faster-indexing-with-arm/</link>
        <pubDate>Mon, 17 Feb 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/vectorchord-02-60k-dimensional-vectors-50-faster-indexing-with-arm/</guid>
        <description>&lt;p&gt;Today, we’re thrilled to share VectorChord 0.2—a release shaped by community feedback and designed to tackle the evolving challenges of vector search in PostgreSQL.&lt;/p&gt;&#xA;&lt;p&gt;%[https://github.com/tensorchord/VectorChord/]&lt;/p&gt;&#xA;&lt;p&gt;&lt;a id=&#34;optimized-storage-layout-supporting-up-to-60-000-dimensions&#34;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2 id=&#34;optimized-storage-layout-supporting-up-to-60000-dimensions&#34;&gt;Optimized Storage Layout: Supporting Up to 60,000 Dimensions&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;In PostgreSQL, the foundational storage unit is an 8KB page. While this design is robust for many workloads, it introduces constraints for modern use cases like high-dimensional vector search. For instance, pgvector faces a hard limit of 2000 dimensions per vector due to this fixed page size, as larger vectors cannot be indexed within a single page.&lt;/p&gt;</description>
      </item>
    <item>
        <title>pgvecto.rs 0.2: Unifying Relational Queries and Vector Search in PostgreSQL</title>
        <link>https://vchord.pgsty.com/blog/release/pgvectors-02-unifying-relational-queries-and-vector-search-in-postgresql/</link>
        <pubDate>Tue, 20 Feb 2024 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/release/pgvectors-02-unifying-relational-queries-and-vector-search-in-postgresql/</guid>
        <description>&lt;p&gt;We are excited to announce the release of &lt;a href=&#34;https://vchord.pgsty.com/pgvecto-rs/&#34;&gt;pgvecto.rs&lt;/a&gt; 0.2, a significant milestone in the journey of bridging the gap between relational queries and vector search in PostgreSQL. This update brings together the power of both worlds, offering enhanced efficiency and enabling complex queries within PostgreSQL.&lt;/p&gt;&#xA;&lt;p&gt;In the past, developers and data scientists encountered the significant challenge of managing separate systems for relational queries and vector search. This resulted in increased complexity and resource overhead. However, with the release of &lt;a href=&#34;https://vchord.pgsty.com/pgvecto-rs/&#34;&gt;pgvecto.rs&lt;/a&gt; 0.2, we have addressed this issue by integrating the cutting-edge &lt;a href=&#34;https://www.usenix.org/conference/osdi23/presentation/zhang-qianxi&#34;&gt;VBASE method from OSDI 2023&lt;/a&gt;. This integration has substantially refined the efficiency of vector search within PostgreSQL.&lt;/p&gt;</description>
      </item>
    
  </channel>
</rss>
