<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>sparsevectors on Vchord</title>
    <link>https://vchord.pgsty.com/tags/sparsevectors/</link>
    <description>Recent content in sparsevectors 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/sparsevectors/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
        <title>Unleash the power of sparse vector</title>
        <link>https://vchord.pgsty.com/blog/post/unleash-the-power-of-sparse-vector/</link>
        <pubDate>Fri, 05 Jul 2024 00:00:00 +0000</pubDate>
        
        <guid>https://vchord.pgsty.com/blog/post/unleash-the-power-of-sparse-vector/</guid>
        <description>&lt;p&gt;In the past, hybrid search combined two search methods: traditional keyword-based search and vector-based similarity search. However, sparse vector can act as a substitute for keyword search, unlocking the full potential of the data pipeline with pure vector search.&lt;/p&gt;&#xA;&lt;p&gt;This post explores how to use how &lt;a href=&#34;https://github.com/FlagOpen/FlagEmbedding/tree/master/FlagEmbedding/BGE_M3&#34;&gt;BGE-M3&lt;/a&gt; and &lt;a href=&#34;https://vchord.pgsty.com/pgvecto-rs/&#34;&gt;pgvecto.rs&lt;/a&gt; to exploit the potential of hybrid search using both sparse and dense vectors.&lt;/p&gt;&#xA;&lt;p&gt;Let&amp;rsquo;s dive in.&lt;/p&gt;&#xA;&lt;h2 id=&#34;an-overview-of-sparse-and-dense-vector-embedding&#34;&gt;An Overview of Sparse and Dense Vector Embedding&#xA;&lt;/h2&gt;&#xA;&lt;img class=&#34;td-image&#34; src=&#34;https://cdn.hashnode.com/res/hashnode/image/upload/v1711958357065/ef840509-b58c-4476-9f6d-9d6c698a86a7.png&#34; alt=&#34;Sparse Vector VS Dense Vector&#34; loading=&#34;lazy&#34; decoding=&#34;async&#34;&gt;&lt;p&gt;Sparse vectors are high-dimensional vectors that contain few non-zero values. They are suitable for traditional information retrieval use cases. For example, a vector with 32,000 dimensions but only 2 non-zero elements is a typical sparse vector.&lt;/p&gt;</description>
      </item>
    
  </channel>
</rss>
