<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>postgresql on Vchord</title>
    <link>https://vchord.pgsty.com/tags/postgresql/</link>
    <description>Recent content in postgresql 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/postgresql/index.xml" rel="self" type="application/rss+xml" />
    
    <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>Bringing Search‑Engine Ranking to PostgreSQL with VectorChord‑BM25</title>
        <link>https://vchord.pgsty.com/blog/post/bringing-searchengine-ranking-to-postgresql-with-vectorchordbm25/</link>
        <pubDate>Tue, 12 Aug 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/bringing-searchengine-ranking-to-postgresql-with-vectorchordbm25/</guid>
        <description>&lt;p&gt;Modern applications rely on PostgreSQL for its fully ACID‑compliant, expressive SQL, and rich ecosystem of extensions. The database handles relational workloads exceptionally well, but many projects also need to search for large text collections—product descriptions, support tickets, documentation—and present the most relevant rows first. PostgreSQL’s native tools offer a foundation for this, yet their default ranking logic can leave ideal matches buried under less useful results. VectorChord‑BM25 changes that equation by introducing the BM25 relevance‑scoring algorithm directly into PostgreSQL.&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord: Cost-Efficient Upload &amp; Search of 400 Million Vectors on AWS</title>
        <link>https://vchord.pgsty.com/blog/post/vectorchord-cost-efficient-upload-and-search-of-400-million-vectors-on-aws/</link>
        <pubDate>Fri, 30 May 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/vectorchord-cost-efficient-upload-and-search-of-400-million-vectors-on-aws/</guid>
        <description>&lt;p&gt;In this article, we will describe one method for uploading, indexing, and searching a big dataset of vector data in a cost-efficient manner using the real-world &lt;a href=&#34;https://laion.ai/blog/laion-400-open-dataset/&#34;&gt;LAION-400M&lt;/a&gt; dataset and the VectorChord extension in PostgreSQL.&lt;/p&gt;&#xA;&lt;p&gt;We&amp;rsquo;re attempting to show you what kind of hardware setup you need to allow you to search through this vast dataset using VectorChord. We want to make sure that you have a good experience with a search that is both accurate and fast.&lt;/p&gt;</description>
      </item>
    <item>
        <title>All-in-one VectorChord Suite: Building Production-Ready RAG Solutions Directly in PostgreSQL</title>
        <link>https://vchord.pgsty.com/blog/post/all-in-one-vectorchord-suite-building-production-ready-rag-solutions-directly-in-postgresql/</link>
        <pubDate>Tue, 29 Apr 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/all-in-one-vectorchord-suite-building-production-ready-rag-solutions-directly-in-postgresql/</guid>
        <description>&lt;p&gt;Retrieval-Augmented Generation (RAG) is revolutionizing our interaction with vast datasets and language models. RAG systems offer more precise, contextually aware, and current answers by retrieving pertinent information before generating responses. Nonetheless, constructing robust, scalable, and efficient RAG pipelines poses considerable challenges, particularly for production use.&lt;/p&gt;&#xA;&lt;p&gt;Many solutions feature complex architectures, using distinct databases for vector search, keyword search, and primary data storage. This commonly results in data synchronization challenges, greater infrastructure complexity, and higher operational costs.&lt;/p&gt;</description>
      </item>
    <item>
        <title>3 Billion Vectors in PostgreSQL to Protect the Earth</title>
        <link>https://vchord.pgsty.com/blog/post/3-billion-vectors-in-postgresql-to-protect-the-earth/</link>
        <pubDate>Tue, 08 Apr 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/3-billion-vectors-in-postgresql-to-protect-the-earth/</guid>
        <description>&lt;p&gt;Monitoring the health of our planet is one of the most critical challenges of our time. Our planet faces immense environmental pressures, and understanding these changes requires sifting through an unimaginable amount of satellite data – petabytes of pixels captured constantly. From tracking deforestation in the Amazon to identifying illegal mining operations in remote regions or monitoring agricultural impacts on sensitive ecosystems, turning this data into actionable intelligence is paramount.&lt;/p&gt;</description>
      </item>
    <item>
        <title>Hybrid search with Postgres Native BM25 and VectorChord</title>
        <link>https://vchord.pgsty.com/blog/post/hybrid-search-with-postgres-native-bm25-and-vectorchord/</link>
        <pubDate>Thu, 13 Mar 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/hybrid-search-with-postgres-native-bm25-and-vectorchord/</guid>
        <description>&lt;p&gt;In the era of RAG (Retrieval-Augmented Generation), efficiently retrieving relevant data from vast datasets is crucial for businesses and developers. Traditional keyword-based retrieval methods, such as those utilizing &lt;strong&gt;BM25&lt;/strong&gt; as a scoring mechanism, excel in ranking documents based on term frequency and exact keyword matches. This makes them highly effective for structured queries and keyword-heavy content. However, they struggle with understanding synonyms, contextual nuances, and semantic intent. Conversely, vector-based retrieval captures deep semantic meaning, enabling better generalization across varied queries but sometimes sacrificing precision in exact keyword matches. Hybrid Search bridges this gap by combining BM25’s precision with vector search’s contextual understanding, delivering faster, more accurate, and semantically aware results.&lt;/p&gt;</description>
      </item>
    <item>
        <title>VectorChord-BM25: Revolutionize PostgreSQL Search with BM25 Ranking — 3x Faster Than ElasticSearch</title>
        <link>https://vchord.pgsty.com/blog/post/vectorchord-bm25-revolutionize-postgresql-search-with-bm25-ranking-3x-faster-than-elasticsearch/</link>
        <pubDate>Mon, 24 Feb 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/vectorchord-bm25-revolutionize-postgresql-search-with-bm25-ranking-3x-faster-than-elasticsearch/</guid>
        <description>&lt;p&gt;We’re excited to share something special with you: &lt;strong&gt;VectorChord-BM25&lt;/strong&gt;, a new extension designed to make PostgreSQL’s full-text search even better. Whether you’re building a small app or managing a large-scale system, this tool brings advanced BM25 scoring and ranking right into PostgreSQL, making your searches smarter and faster.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a id=&#34;what-s-new&#34;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h3 id=&#34;whats-new&#34;&gt;&lt;strong&gt;What’s New?&lt;/strong&gt;&#xA;&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&#xA;&lt;p&gt;&lt;strong&gt;BM25 Scoring &amp;amp; Ranking&lt;/strong&gt;: Get more precise and relevant search results with BM25, helping you find what matters most.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;p&gt;&lt;strong&gt;Optimized Indexing&lt;/strong&gt;: Thanks to the Block WeakAnd algorithm, searches are quicker and more efficient, even with large datasets.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;&#xA;&lt;p&gt;&lt;strong&gt;Enhanced Tokenization&lt;/strong&gt;: Improved stemming and stop word handling mean better accuracy and smoother performance.&lt;/p&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
      </item>
    <item>
        <title>Do we really need a specialized vector database? (2023)</title>
        <link>https://vchord.pgsty.com/blog/post/do-we-really-need-a-specialized-vector-database-2023/</link>
        <pubDate>Tue, 18 Feb 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/do-we-really-need-a-specialized-vector-database-2023/</guid>
        <description>&lt;blockquote&gt;&#xA;&lt;p&gt;Notice: This article, originally published in 2023, discusses the relevance and necessity of specialized vector databases, particularly in relation to Postgres and its capabilities. For further insights and discussions on this topic, please refer to the following link: &lt;a href=&#34;https://news.ycombinator.com/item?id=37097004&#34;&gt;Do we really need a specialized vector database? | Hacker News&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;With the popularity of LLM (Large Language Model), vector databases have also become a hot topic. With just a few lines of simple Python code, a vector database can act as a cheap but highly effective &amp;ldquo;external brain&amp;rdquo; for your LLM. But do we really need a specialized vector database?&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>ARM &#43; VectorChord: Affordable, Fast Vector Search</title>
        <link>https://vchord.pgsty.com/blog/post/arm-vectorchord-affordable-fast-vector-search/</link>
        <pubDate>Tue, 21 Jan 2025 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/arm-vectorchord-affordable-fast-vector-search/</guid>
        <description>&lt;p&gt;ARM64 is quietly becoming a go-to for cost-effective cloud servers, especially on AWS. With ARM-based processors like the Graviton series (Graviton3 and Graviton4), you can save a good chunk of money without sacrificing performance. These ARM64 instances are way more affordable than traditional x86 ones, making them a solid choice for balancing cost and performance in the cloud.&lt;/p&gt;&#xA;&lt;p&gt;That said, ARM’s architecture differs from x86, so software that isn’t optimized for it might run slower due to emulation. This is where &lt;strong&gt;VectorChord&lt;/strong&gt; steps in—a PostgreSQL extension designed for scalable, high-performance, and disk-efficient vector similarity search. As the successor to &lt;a href=&#34;https://vchord.pgsty.com/pgvecto-rs/&#34;&gt;pgvecto.rs&lt;/a&gt;, VectorChord lets you store a whopping &lt;strong&gt;400,000 vectors for just $1&lt;/strong&gt;, delivering massive savings: &lt;strong&gt;6x more vectors&lt;/strong&gt; than Pinecone&amp;rsquo;s optimized storage and &lt;strong&gt;26x more&lt;/strong&gt; than pgvector / &lt;a href=&#34;https://vchord.pgsty.com/pgvecto-rs/&#34;&gt;pgvecto.rs&lt;/a&gt; for the same price.&lt;/p&gt;</description>
      </item>
    <item>
        <title>Why HNSW is Not the Answer</title>
        <link>https://vchord.pgsty.com/blog/post/why-hnsw-is-not-the-answer/</link>
        <pubDate>Wed, 18 Dec 2024 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/why-hnsw-is-not-the-answer/</guid>
        <description>&lt;p&gt;HNSW (Hierarchical Navigable Small World) has become the go-to algorithm for many vector databases. Its multi-layered graph structure and ability to efficiently navigate vector embeddings make it particularly appealing. However, despite its apparent advantages, HNSW may not be the optimal solution for large-scale and dynamic vector similarity search. In this blog post, we challenge the dominance of HNSW and explore why disk-based alternatives, such as IVF (Inverted File Index), might be more practical for massive datasets.&lt;/p&gt;</description>
      </item>
    <item>
        <title>Introducing Terraform Support for PGVecto.rs Cloud</title>
        <link>https://vchord.pgsty.com/blog/post/introducing-terraform-support-for-pgvectors-cloud/</link>
        <pubDate>Wed, 24 Jul 2024 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/introducing-terraform-support-for-pgvectors-cloud/</guid>
        <description>&lt;p&gt;We are thrilled to announce the release of our &lt;a href=&#34;https://registry.terraform.io/providers/tensorchord/pgvecto-rs-cloud/latest&#34;&gt;Terraform provider for PGVecto.rs Cloud&lt;/a&gt;. This new provider is designed to simplify the process of managing resources on our &lt;a href=&#34;https://vchord.pgsty.com/cloud/&#34;&gt;cloud service&lt;/a&gt;, providing users with an intuitive and streamlined experience for managing their Postgres cluster setup and operation through infrastructure as a code tool — &lt;strong&gt;Terraform&lt;/strong&gt;. For those unfamiliar with &lt;a href=&#34;https://www.terraform.io/&#34;&gt;Terraform&lt;/a&gt;, it is an open-source tool for building, changing, and versioning infrastructure safely and efficiently. It enables users to define their infrastructure as code, allowing them to provision and manage resources programmatically.&lt;/p&gt;</description>
      </item>
    <item>
        <title>My binary vector search is better than your FP32 vectors</title>
        <link>https://vchord.pgsty.com/blog/post/my-binary-vector-search-is-better-than-your-fp32-vectors/</link>
        <pubDate>Fri, 22 Mar 2024 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/my-binary-vector-search-is-better-than-your-fp32-vectors/</guid>
        <description>&lt;p&gt;Within the field of vector search, an intriguing development has arisen: binary vector search. This approach shows promise in tackling the long-standing issue of memory consumption by achieving a remarkable 30x reduction. However, a critical aspect that sparks debate is its effect on accuracy.&lt;/p&gt;&#xA;&lt;p&gt;We believe that using binary vector search, along with specific optimization techniques, can maintain similar accuracy. To provide clarity on this subject, we showcase a series of experiments that will demonstrate the effects and implications of this approach.&lt;/p&gt;</description>
      </item>
    
  </channel>
</rss>
