<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Benchmarks on Vchord</title>
    <link>https://vchord.pgsty.com/docs/vchord/benchmark/</link>
    <description>Recent content in Benchmarks on Vchord</description>
    <generator>Hugo</generator>
    <language>en-US</language>
    
    
    
      <lastBuildDate>Tue, 03 Nov 2026 01:15:06 +0800</lastBuildDate>
    
    
      <atom:link href="https://vchord.pgsty.com/docs/vchord/benchmark/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
        <title>Price Benchmark</title>
        <link>https://vchord.pgsty.com/docs/vchord/benchmark/price/</link>
        <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/docs/vchord/benchmark/price/</guid>
        <description>&lt;p&gt;Using VectorChord, you can achieve a QPS of 131 with 0.95 precision on 100 million 768-dimensional vectors for the top 10 queries. This setup costs only $250 monthly and can be hosted on a single machine. If you are interested in the details of our implementation, please refer to our blog &lt;a href=&#34;https://vchord.pgsty.com/blog/post/vectorchord-store-400k-vectors-for-1-in-postgresql/&#34;&gt;VectorChord: Store 400k Vectors for $1 in PostgreSQL&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;This means you can store 400k vectors for only $1, allowing you to save significantly: 6x more vectors compared to Pinecone (storage optimized instance) and 26x more than pgvector/pgvecto.rs for the same price.&lt;/p&gt;</description>
      </item>
    <item>
        <title>Performance Benchmarking</title>
        <link>https://vchord.pgsty.com/docs/vchord/benchmark/performance/</link>
        <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/docs/vchord/benchmark/performance/</guid>
        <description>&lt;p&gt;Here we present a comprehensive benchmark comparing our implementation of VectorChord with other vector databases, focusing on QPS and scalability.  If you are interested in the details of our implementation, please refer to our blog &lt;a href=&#34;https://vchord.pgsty.com/blog/post/vectorchord-store-400k-vectors-for-1-in-postgresql/&#34;&gt;VectorChord: Store 400k Vectors for $1 in PostgreSQL&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a id=&#34;QPS&#34;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2 id=&#34;qps&#34;&gt;QPS&#xA;&lt;/h2&gt;&#xA;&lt;h3 id=&#34;laion-5m&#34;&gt;LAION 5M&#xA;&lt;/h3&gt;&#xA;&lt;img src=&#34;https://vchord.pgsty.com/docs/images/laion-5m-top10.png&#34; alt=&#34;QPS on LAION 5M top 10&#34; style=&#34;width: 100%; height: auto; margin: 0 auto; display: block;&#34; /&gt;&#xA;&lt;p&gt;In LAION 5M dataset, VectorChord achieved more than 3x QPS at 0.95 recall compared to different vector databases, including MyScale, pgvector, pinecone, weaviate, qdrant and zilliz(milvus).&lt;/p&gt;</description>
      </item>
    <item>
        <title>Benchmark with pgvector</title>
        <link>https://vchord.pgsty.com/docs/vchord/benchmark/pgvector/</link>
        <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/docs/vchord/benchmark/pgvector/</guid>
        <description>&lt;p&gt;In this section, we compare VectorChord with pgvector, a PostgreSQL extension that provides vector similarity search capabilities. We will focus on four key metrics: QPS (Queries Per Second), Recall@100, Index Building Time, and Insertion Time. If you are interested in the details of our implementation, please refer to our blog &lt;a href=&#34;https://vchord.pgsty.com/blog/post/vector-search-over-postgresql-a-comparative-analysis-of-memory-and-disk-solutions/&#34;&gt;Vector Search Over PostgreSQL: A Comparative Analysis of Memory and Disk Solutions&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2 id=&#34;qps--recall&#34;&gt;QPS &amp;amp; Recall&#xA;&lt;/h2&gt;&#xA;&lt;img src=&#34;https://vchord.pgsty.com/docs/images/gist-1m-top10.png&#34; alt=&#34;QPS on GIST 1m, Top 10&#34; style=&#34;width: 100%; height: auto; margin: 0 auto; display: block;&#34; /&gt;&#xA;&lt;p&gt;Here are some initial benchmark results for the GIST dataset, which consists of 1 million vectors in 960 dimensions. With equivalent recall, VectorChord&amp;rsquo;s QPS could be twice that of pgvector. More details will be provided in the Benchmark section.&lt;/p&gt;</description>
      </item>
    <item>
        <title>Benchmark with Elasticsearch</title>
        <link>https://vchord.pgsty.com/docs/vchord/benchmark/elasticsearch/</link>
        <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/docs/vchord/benchmark/elasticsearch/</guid>
        <description>&lt;p&gt;Here we present a comprehensive benchmark comparing our implementation of VectorChord-BM25 with ElasticSearch, focusing on two key metrics: QPS (Queries Per Second) and NDCG@10 (Normalized Discounted Cumulative Gain at rank 10). If you are interested in the details of our implementation, please refer to our blog &lt;a href=&#34;https://vchord.pgsty.com/blog/post/vectorchord-bm25-revolutionize-postgresql-search-with-bm25-ranking-3x-faster-than-elasticsearch/&#34;&gt;VectorChord-BM25: Revolutionize PostgreSQL Search with BM25 Ranking — 3x Faster Than ElasticSearch&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a id=&#34;RPS&#34;&gt;&lt;/a&gt;&lt;/p&gt;&#xA;&lt;h2 id=&#34;rps&#34;&gt;RPS&#xA;&lt;/h2&gt;&#xA;&lt;img src=&#34;https://vchord.pgsty.com/docs/images/es-vchord-bm25-rps.png&#34; alt=&#34;RPS&#34; style=&#34;width: 100%; height: auto; margin: 0 auto; display: block;&#34; /&gt;&#xA;&lt;p&gt;We compare the Top1000 Queries Per Second (QPS)—a metric that measures how many queries a system can process per second while retrieving the top 1000 results for each query—between our implementation and ElasticSearch across various datasets from &lt;a href=&#34;https://github.com/xhluca/bm25-benchmarks&#34;&gt;bm25-benchmarks&lt;/a&gt;. On average, our implementation achieves &lt;strong&gt;3 times higher QPS&lt;/strong&gt; compared to ElasticSearch across the tested datasets, showcasing its efficiency and scalability.&lt;/p&gt;</description>
      </item>
    <item>
        <title>Benchmark with pgvectorscale</title>
        <link>https://vchord.pgsty.com/docs/vchord/benchmark/pgvectorscale/</link>
        <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/docs/vchord/benchmark/pgvectorscale/</guid>
        <description>&lt;p&gt;In this section, we compare VectorChord with pgvectorscale, a PostgreSQL extension that provides vector similarity search capabilities. We will focus on four key metrics: QPS (Queries Per Second), Recall@10/100, Index Building Time, and Insertion Time. Memory and disk performance will also be discussed. If you are interested in the details of our implementation, please refer to our blog &lt;a href=&#34;https://vchord.pgsty.com/blog/post/vector-search-over-postgresql-a-comparative-analysis-of-memory-and-disk-solutions/&#34;&gt;Vector Search Over PostgreSQL: A Comparative Analysis of Memory and Disk Solutions&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2 id=&#34;qps--recall&#34;&gt;QPS &amp;amp; Recall&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;a id=&#34;Memory&#34;&gt;&lt;/a&gt;&lt;/p&gt;</description>
      </item>
    
  </channel>
</rss>
