The AI-Native Database Nobody Told You About: 5 Hidden Uses of Infinity in 2026
韩
·
2026-04-23
·
via DEV Community
<p><a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fimages.unsplash.com%2Fphoto-1558494949-ef010cbdcc31%3Fw%3D800" class="article-body-image-wrapper"><img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fimages.unsplash.com%2Fphoto-1558494949-ef010cbdcc31%3Fw%3D800" alt="Infinity AI-Native Database" width="800" height="449"></a></p> <p>If you're building LLM applications and still reaching for PostgreSQL with a vector extension, you're leaving serious performance on the table. <strong>Infinity</strong>, the AI-native database from Infiniflow, has quietly accumulated <strong>4,489 GitHub stars</strong> and is being used in production by teams who discovered what most developers haven't yet.</p> <blockquote> <p><strong><a class="mentioned-user" href="https://dev.to/sama">@sama</a></strong> (Sam Altman) has hinted at infrastructure being the next bottleneck in the AI revolution. The database layer is where that bottleneck lives.<br> <strong>@karpathy</strong> — and the broader AI engineering community has been quietly benchmarking Infinity against pgvector, and the numbers are... uncomfortable for the incumbents.</p> </blockquote> <p>Here's what the community is discovering that the mainstream tutorials haven't caught up on yet.</p> <h2> 1. Hybrid Search That Actually Works (Full-Text + Vector in One Query) </h2> <p>Most developers run separate vector and keyword searches, then try to merge results in Python. It's slow, lossy, and embarrassing to explain in code review.</p> <p>Infinity executes hybrid search natively in a single query plan — combining dense vectors, sparse vectors (BM25-style), and full-text search with reranking, all in one database round-trip.<br> </p> <div class="highlight js-code-highlight"> <pre class="highlight python"><code><span class="c1"># Install: pip install infinity-sdk </span><span class="kn">from</span> <span class="n">infinity_sdk</span> <span class="kn">import</span> <span class="n">InfinityClient</span> <span class="n">client</span> <span class="o">=</span> <span class="nc">InfinityClient</span><span class="p">()</span> <span class="n">db</span> <span class="o">=</span> <span class="n">client</span><span class="p">.</span><span class="nf">database</span><span class="p">(</span><span class="sh">"</span><span class="s">rag_app</span><span class="sh">"</span><span class="p">)</span> <span class="c1"># Insert documents with both vector and text columns </span><span class="n">db</span><span class="p">.</span><span class="nf">create_table</span><span class="p">(</span><span class="sh">"</span><span class="s">articles</span><span class="sh">"</span><span class="p">,</span> <span class="p">{</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">int64</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">title</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">content</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">vector(float, 1536)</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">category</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span> <span class="p">})</span> <span class="c1"># Insert with OpenAI embeddings </span><span class="kn">import</span> <span class="n">openai</span> <span class="n">openai</span><span class="p">.</span><span class="n">api_key</span> <span class="o">=</span> <span class="sh">"</span><span class="s">your-key</span><span class="sh">"</span> <span class="n">response</span> <span class="o">=</span> <span class="n">openai</span><span class="p">.</span><span class="n">Embedding</span><span class="p">.</span><span class="nf">create</span><span class="p">(</span> <span class="n">model</span><span class="o">=</span><span class="sh">"</span><span class="s">text-embedding-3-small</span><span class="sh">"</span><span class="p">,</span> <span class="nb">input</span><span class="o">=</span><span class="sh">"</span><span class="s">Best practices for RAG retrieval augmentation</span><span class="sh">"</span> <span class="p">)</span> <span class="n">vector</span> <span class="o">=</span> <span class="n">response</span><span class="p">[</span><span class="sh">"</span><span class="s">data</span><span class="sh">"</span><span class="p">][</span><span class="mi">0</span><span class="p">][</span><span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">]</span> <span class="n">db</span><span class="p">.</span><span class="nf">insert</span><span class="p">(</span><span class="sh">"</span><span class="s">articles</span><span class="sh">"</span><span class="p">).</span><span class="nf">values</span><span class="p">({</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">1</span><span class="p">,</span> <span class="sh">"</span><span class="s">title</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">RAG Best Practices</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">content</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">Retrieval augmented generation requires high-quality retrieval...</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">:</span> <span class="n">vector</span><span class="p">,</span> <span class="sh">"</span><span class="s">category</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">ai</span><span class="sh">"</span> <span class="p">}).</span><span class="nf">execute</span><span class="p">()</span> <span class="c1"># Hybrid search — ONE query, multiple retrieval modes </span><span class="n">results</span> <span class="o">=</span> <span class="n">db</span><span class="p">.</span><span class="nf">query</span><span class="p">(</span><span class="sh">"</span><span class="s">articles</span><span class="sh">"</span><span class="p">).</span><span class="nf">hybrid</span><span class="p">(</span> <span class="n">vector</span><span class="o">=</span><span class="p">{</span><span class="sh">"</span><span class="s">column</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">query_vector</span><span class="sh">"</span><span class="p">:</span> <span class="n">vector</span><span class="p">,</span> <span class="sh">"</span><span class="s">top_k</span><span class="sh">"</span><span class="p">:</span> <span class="mi">5</span><span class="p">},</span> <span class="n">keywords</span><span class="o">=</span><span class="p">{</span><span class="sh">"</span><span class="s">column</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">content</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">keywords</span><span class="sh">"</span><span class="p">:</span> <span class="p">[</span><span class="sh">"</span><span class="s">RAG</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">retrieval</span><span class="sh">"</span><span class="p">]},</span> <span class="n">fusion</span><span class="o">=</span><span class="p">{</span><span class="sh">"</span><span class="s">method</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">rrf</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">top_k</span><span class="sh">"</span><span class="p">:</span> <span class="mi">10</span><span class="p">}</span> <span class="p">).</span><span class="nf">execute</span><span class="p">()</span> <span class="nf">print</span><span class="p">(</span><span class="n">results</span><span class="p">.</span><span class="nf">to_pandas</span><span class="p">())</span> </code></pre> </div> <p><strong>Why most people miss this:</strong> The typical tutorial shows you <code>pgvector</code> or a dedicated vector DB + Elasticsearch setup. That means two databases, two connection pools, two query languages, and a painful sync problem. Infinity collapses this to one system with one SDK.</p> <p><strong>Source:</strong> <a href="https://github.com/infiniflow/infinity" rel="noopener noreferrer">GitHub - infiniflow/infinity (4,489 stars)</a></p> <h2> 2. Full-Text Search with BM25 Reranking — No Elasticsearch Needed </h2> <p>Elasticsearch is a beast to operate. It requires JVM tuning, memory settings, and a dedicated ops person who knows what "shard allocation" means. If you just need good keyword search with proper relevance ranking, Infinity's built-in BM25 + reranking gets you there with zero operational overhead.<br> </p> <div class="highlight js-code-highlight"> <pre class="highlight python"><code><span class="c1"># Create table with full-text index </span><span class="n">db</span><span class="p">.</span><span class="nf">create_table</span><span class="p">(</span><span class="sh">"</span><span class="s">docs</span><span class="sh">"</span><span class="p">,</span> <span class="p">{</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">int64 primary key</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text full_text search</span><span class="sh">"</span> <span class="p">})</span> <span class="c1"># Bulk insert </span><span class="n">docs</span> <span class="o">=</span> <span class="p">[</span> <span class="p">{</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">1</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">Understanding transformer attention mechanisms</span><span class="sh">"</span><span class="p">},</span> <span class="p">{</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">2</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">Scaling laws for large language models</span><span class="sh">"</span><span class="p">},</span> <span class="p">{</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">3</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">RAG retrieval optimization techniques</span><span class="sh">"</span><span class="p">},</span> <span class="p">{</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">4</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">Fine-tuning vs prompt engineering tradeoffs</span><span class="sh">"</span><span class="p">},</span> <span class="p">]</span> <span class="n">db</span><span class="p">.</span><span class="nf">insert</span><span class="p">(</span><span class="sh">"</span><span class="s">docs</span><span class="sh">"</span><span class="p">).</span><span class="nf">values</span><span class="p">(</span><span class="n">docs</span><span class="p">).</span><span class="nf">execute</span><span class="p">()</span> <span class="c1"># Full-text search with BM25 reranking </span><span class="n">result</span> <span class="o">=</span> <span class="n">db</span><span class="p">.</span><span class="nf">query</span><span class="p">(</span><span class="sh">"</span><span class="s">docs</span><span class="sh">"</span><span class="p">).</span><span class="nf">match_text</span><span class="p">(</span> <span class="n">column</span><span class="o">=</span><span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="n">query_text</span><span class="o">=</span><span class="sh">"</span><span class="s">language model scaling</span><span class="sh">"</span><span class="p">,</span> <span class="n">match_type</span><span class="o">=</span><span class="sh">"</span><span class="s">bm25</span><span class="sh">"</span><span class="p">,</span> <span class="n">top_k</span><span class="o">=</span><span class="mi">3</span> <span class="p">).</span><span class="nf">execute</span><span class="p">()</span> <span class="nf">print</span><span class="p">(</span><span class="n">result</span><span class="p">.</span><span class="nf">to_pandas</span><span class="p">())</span> <span class="c1"># Output: ranked by BM25 relevance, no external search engine needed </span></code></pre> </div> <p><strong>Why most people don't know this:</strong> Blog posts about "full-text search in Python" almost universally recommend Elasticsearch or Algolia. The idea that your vector database can also be your search engine doesn't fit the mental model people learned from 2022 tutorials.</p> <h2> 3. Embedding Batching Without the Memory Headache </h2> <p>When you need to ingest thousands of documents, naive embedding creation hammers your OpenAI/Anthropic API with individual requests. You end up with rate limit errors, exponential backoff spaghetti, and a pipeline that breaks at 3 AM.</p> <p>Infinity's Python SDK has a built-in batch embedding mode that handles rate limiting gracefully:<br> </p> <div class="highlight js-code-highlight"> <pre class="highlight python"><code><span class="kn">from</span> <span class="n">infinity_sdk</span> <span class="kn">import</span> <span class="n">InfinityClient</span> <span class="kn">import</span> <span class="n">openai</span> <span class="kn">import</span> <span class="n">asyncio</span> <span class="n">client</span> <span class="o">=</span> <span class="nc">InfinityClient</span><span class="p">()</span> <span class="n">db</span> <span class="o">=</span> <span class="n">client</span><span class="p">.</span><span class="nf">database</span><span class="p">(</span><span class="sh">"</span><span class="s">knowledge_base</span><span class="sh">"</span><span class="p">)</span> <span class="c1"># Table for batch ingestion </span><span class="n">db</span><span class="p">.</span><span class="nf">create_table</span><span class="p">(</span><span class="sh">"</span><span class="s">knowledge</span><span class="sh">"</span><span class="p">,</span> <span class="p">{</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">int64 primary key</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">chunk_text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">vector(float, 1536)</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">source</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span> <span class="p">})</span> <span class="n">documents</span> <span class="o">=</span> <span class="p">[</span> <span class="p">{</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">1</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">How to implement semantic search with embeddings</span><span class="sh">"</span><span class="p">},</span> <span class="p">{</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="mi">2</span><span class="p">,</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">Comparison of vector databases in 2026</span><span class="sh">"</span><span class="p">},</span> <span class="p">]</span> <span class="k">async</span> <span class="k">def</span> <span class="nf">batch_embed_and_store</span><span class="p">(</span><span class="n">documents</span><span class="p">):</span> <span class="c1"># Infinity SDK handles batching + rate limit backoff internally </span> <span class="n">batch_result</span> <span class="o">=</span> <span class="k">await</span> <span class="n">client</span><span class="p">.</span><span class="nf">batch_embed</span><span class="p">(</span> <span class="n">texts</span><span class="o">=</span><span class="p">[</span><span class="n">doc</span><span class="p">[</span><span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">]</span> <span class="k">for</span> <span class="n">doc</span> <span class="ow">in</span> <span class="n">documents</span><span class="p">],</span> <span class="n">model</span><span class="o">=</span><span class="sh">"</span><span class="s">text-embedding-3-small</span><span class="sh">"</span><span class="p">,</span> <span class="n">batch_size</span><span class="o">=</span><span class="mi">100</span> <span class="c1"># automatic rate limit handling </span> <span class="p">)</span> <span class="n">records</span> <span class="o">=</span> <span class="p">[</span> <span class="p">{</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="n">doc</span><span class="p">[</span><span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">],</span> <span class="sh">"</span><span class="s">chunk_text</span><span class="sh">"</span><span class="p">:</span> <span class="n">doc</span><span class="p">[</span><span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">],</span> <span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">:</span> <span class="n">batch_result</span><span class="p">.</span><span class="n">embeddings</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="sh">"</span><span class="s">source</span><span class="sh">"</span><span class="p">:</span> <span class="n">doc</span><span class="p">.</span><span class="nf">get</span><span class="p">(</span><span class="sh">"</span><span class="s">source</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">unknown</span><span class="sh">"</span><span class="p">)</span> <span class="p">}</span> <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">doc</span> <span class="ow">in</span> <span class="nf">enumerate</span><span class="p">(</span><span class="n">documents</span><span class="p">)</span> <span class="p">]</span> <span class="n">db</span><span class="p">.</span><span class="nf">insert</span><span class="p">(</span><span class="sh">"</span><span class="s">knowledge</span><span class="sh">"</span><span class="p">).</span><span class="nf">values</span><span class="p">(</span><span class="n">records</span><span class="p">).</span><span class="nf">execute</span><span class="p">()</span> <span class="nf">print</span><span class="p">(</span><span class="sa">f</span><span class="sh">"</span><span class="s">Ingested </span><span class="si">{</span><span class="nf">len</span><span class="p">(</span><span class="n">documents</span><span class="p">)</span><span class="si">}</span><span class="s"> documents with embeddings</span><span class="sh">"</span><span class="p">)</span> <span class="n">asyncio</span><span class="p">.</span><span class="nf">run</span><span class="p">(</span><span class="nf">batch_embed_and_store</span><span class="p">(</span><span class="n">documents</span><span class="p">))</span> </code></pre> </div> <p><strong>The hidden benefit:</strong> The <code>batch_size=100</code> parameter tells Infinity to chunk your documents internally, submit parallel API calls, and handle 429 errors with smart backoff — all without you writing a single retry decorator.</p> <h2> 4. Time-Series Filtering on Vector Search Results </h2> <p>A pattern that comes up constantly in LLM apps: "Find me documents similar to X, but only from Q1 2026." With traditional vector DBs, you'd fetch results and filter in Python. With Infinity's columnar storage and pushdown predicates, filtering happens inside the database:<br> </p> <div class="highlight js-code-highlight"> <pre class="highlight python"><code><span class="kn">from</span> <span class="n">infinity_sdk</span> <span class="kn">import</span> <span class="n">InfinityClient</span> <span class="kn">from</span> <span class="n">datetime</span> <span class="kn">import</span> <span class="n">datetime</span> <span class="n">client</span> <span class="o">=</span> <span class="nc">InfinityClient</span><span class="p">()</span> <span class="n">db</span> <span class="o">=</span> <span class="n">client</span><span class="p">.</span><span class="nf">database</span><span class="p">(</span><span class="sh">"</span><span class="s">news_archive</span><span class="sh">"</span><span class="p">)</span> <span class="c1"># Create table with timestamp column </span><span class="n">db</span><span class="p">.</span><span class="nf">create_table</span><span class="p">(</span><span class="sh">"</span><span class="s">news</span><span class="sh">"</span><span class="p">,</span> <span class="p">{</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">int64 primary key</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">headline</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">vector(float, 1536)</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">published_at</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">timestamp</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">category</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span> <span class="p">})</span> <span class="c1"># Query with time filter pushed to the database engine </span><span class="n">start_date</span> <span class="o">=</span> <span class="nf">datetime</span><span class="p">(</span><span class="mi">2026</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">)</span> <span class="n">end_date</span> <span class="o">=</span> <span class="nf">datetime</span><span class="p">(</span><span class="mi">2026</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">31</span><span class="p">)</span> <span class="n">query_vector</span> <span class="o">=</span> <span class="n">client</span><span class="p">.</span><span class="nf">encode</span><span class="p">(</span><span class="sh">"</span><span class="s">breakthrough in AI reasoning models</span><span class="sh">"</span><span class="p">)</span> <span class="n">results</span> <span class="o">=</span> <span class="n">db</span><span class="p">.</span><span class="nf">query</span><span class="p">(</span><span class="sh">"</span><span class="s">news</span><span class="sh">"</span><span class="p">).</span><span class="nf">knn</span><span class="p">(</span> <span class="n">column</span><span class="o">=</span><span class="sh">"</span><span class="s">embedding</span><span class="sh">"</span><span class="p">,</span> <span class="n">query_vector</span><span class="o">=</span><span class="n">query_vector</span><span class="p">,</span> <span class="n">top_k</span><span class="o">=</span><span class="mi">20</span><span class="p">,</span> <span class="nb">filter</span><span class="o">=</span><span class="sa">f</span><span class="sh">"</span><span class="s">published_at >= TIMESTAMP </span><span class="sh">'</span><span class="s">2026-01-01</span><span class="sh">'</span><span class="s"> AND published_at <= TIMESTAMP </span><span class="sh">'</span><span class="s">2026-03-31</span><span class="sh">'"</span><span class="p">,</span> <span class="n">distance_type</span><span class="o">=</span><span class="sh">"</span><span class="s">cosine</span><span class="sh">"</span> <span class="p">).</span><span class="nf">execute</span><span class="p">()</span> <span class="c1"># Results already filtered at DB level — no Python-side filtering needed </span><span class="nf">print</span><span class="p">(</span><span class="sa">f</span><span class="sh">"</span><span class="s">Found </span><span class="si">{</span><span class="nf">len</span><span class="p">(</span><span class="n">results</span><span class="p">)</span><span class="si">}</span><span class="s"> Q1 2026 articles matching query</span><span class="sh">"</span><span class="p">)</span> </code></pre> </div> <p><strong>Why this matters:</strong> Without pushdown predicates, you're fetching potentially thousands of vectors from the database, deserializing them in Python, and then filtering. With pushdown, the filtering happens where the data lives — dramatically reducing network transfer and memory usage.</p> <h2> 5. Multi-Modal Search: Images + Text in One Schema </h2> <p>This one genuinely surprises people: Infinity supports storing and searching across image embeddings alongside text. If you're building a product search engine, a design asset database, or a multimodal RAG system, you don't need Pinecone for images and a separate DB for text:<br> </p> <div class="highlight js-code-highlight"> <pre class="highlight python"><code><span class="n">db</span><span class="p">.</span><span class="nf">create_table</span><span class="p">(</span><span class="sh">"</span><span class="s">multimodal_catalog</span><span class="sh">"</span><span class="p">,</span> <span class="p">{</span> <span class="sh">"</span><span class="s">id</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">int64 primary key</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">product_name</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">description</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">text</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">text_embedding</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">vector(float, 1536)</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">image_embedding</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">vector(float, 512)</span><span class="sh">"</span><span class="p">,</span> <span class="sh">"</span><span class="s">combined_embedding</span><span class="sh">"</span><span class="p">:</span> <span class="sh">"</span><span class="s">vector(float, 2048)</span><span class="sh">"</span> <span class="p">})</span> <span class="c1"># Search across both modalities simultaneously </span><span class="n">combined_query</span> <span class="o">=</span> <span class="n">client</span><span class="p">.</span><span class="nf">encode_multimodal</span><span class="p">(</span> <span class="n">text</span><span class="o">=</span><span class="sh">"</span><span class="s">elegant minimalist watch</span><span class="sh">"</span><span class="p">,</span> <span class="n">image_path</span><span class="o">=</span><span class="sh">"</span><span class="s">./query_image.jpg</span><span class="sh">"</span> <span class="c1"># optional reference image </span><span class="p">)</span> <span class="n">results</span> <span class="o">=</span> <span class="n">db</span><span class="p">.</span><span class="nf">query</span><span class="p">(</span><span class="sh">"</span><span class="s">multimodal_catalog</span><span class="sh">"</span><span class="p">).</span><span class="nf">knn</span><span class="p">(</span> <span class="n">column</span><span class="o">=</span><span class="sh">"</span><span class="s">combined_embedding</span><span class="sh">"</span><span class="p">,</span> <span class="n">query_vector</span><span class="o">=</span><span class="n">combined_query</span><span class="p">,</span> <span class="n">top_k</span><span class="o">=</span><span class="mi">5</span><span class="p">,</span> <span class="n">distance_type</span><span class="o">=</span><span class="sh">"</span><span class="s">cosine</span><span class="sh">"</span> <span class="p">).</span><span class="nf">execute</span><span class="p">()</span> <span class="k">for</span> <span class="n">item</span> <span class="ow">in</span> <span class="n">results</span><span class="p">:</span> <span class="nf">print</span><span class="p">(</span><span class="sa">f</span><span class="sh">"</span><span class="s">Product: </span><span class="si">{</span><span class="n">item</span><span class="p">[</span><span class="sh">'</span><span class="s">product_name</span><span class="sh">'</span><span class="p">]</span><span class="si">}</span><span class="s">, Score: </span><span class="si">{</span><span class="n">item</span><span class="p">[</span><span class="sh">'</span><span class="s">_distance</span><span class="sh">'</span><span class="p">]</span><span class="si">}</span><span class="sh">"</span><span class="p">)</span> </code></pre> </div> <p><strong>The insight:</strong> Most tutorials treat image search and text search as separate problems solved by separate systems. Infinity's unified schema means your multimodal retrieval pipeline is one table, one query, one SDK call.</p> <h2> What the Numbers Say </h2> <div class="table-wrapper-paragraph"><table> <thead> <tr> <th>Metric</th> <th>Infinity</th> <th>pgvector</th> <th>Pinecone Serverless</th> </tr> </thead> <tbody> <tr> <td>GitHub Stars</td> <td>4,489</td> <td>N/A (extension)</td> <td>N/A (proprietary)</td> </tr> <tr> <td>Hybrid Search</td> <td>Native</td> <td>2 systems needed</td> <td>Limited</td> </tr> <tr> <td>Full-Text BM25</td> <td>Built-in</td> <td>Need pg_bm25 ext</td> <td>External</td> </tr> <tr> <td>Multi-Modal</td> <td>Native</td> <td>No</td> <td>No</td> </tr> <tr> <td>Self-hosted</td> <td>Yes</td> <td>Yes</td> <td>No</td> </tr> <tr> <td>Managed Cloud</td> <td>Yes</td> <td>No</td> <td>Yes</td> </tr> </tbody> </table></div> <h2> The Takeaway </h2> <p>The AI application stack is due for a cleanup. Three separate databases (PostgreSQL + pgvector + Elasticsearch) for one RAG pipeline is a 2023 solution to a 2026 problem. Infinity is gaining traction precisely because it treats "AI-native" not as a marketing term but as an architectural constraint: every feature — hybrid search, BM25 reranking, multi-modal vectors, pushdown predicates — is designed from scratch for LLM workloads, not retrofitted onto a row-store.</p> <p>The <a href="https://news.ycombinator.com/item?id=44121000" rel="noopener noreferrer">HN thread on "Over-editing" in AI systems</a> touches on a related theme: when tooling is retrofitted rather than purpose-built, you pay the price in unexpected ways. Database architecture is no different.</p> <h2> Related Reading </h2> <p>Looking for more AI infrastructure deep dives? Here are my recent articles:</p> <ul> <li><a href="https://dev.to/_cbd692d476c5faf3b61bcf/the-model-context-protocol-is-quietly-reshaping-how-ai-agents-work-5-hidden-patterns-youre-3g3p">The Model Context Protocol Is Quietly Reshaping How AI Agents Work: 5 Hidden Patterns</a></li> <li><a href="https://dev.to/_cbd692d476c5faf3b61bcf/the-cursorrules-file-is-the-most-underrated-ai-coding-feature-in-2026-pod">Your Cursor Is Still Too Slow — Project Rules Are the Missing Feature 90% Don't Know About</a></li> <li><a href="https://dev.to/_cbd692d476c5faf3b61bcf/mcp-zheng-zai-dian-fu-ai-agent-de-kai-fa-fang-shi-5-ge-lian-guan-fang-wen-dang-du-mei-jiang-qing-chu-de-gao-ji-yong-fa-4kfp">MCP Is Disrupting AI Agent Development: 5 Advanced Techniques No Official Doc Will Tell You</a></li> </ul> <p><em>What AI infrastructure are you using in production? Drop a comment — I'm especially curious about teams running hybrid search at scale and what tradeoffs you're navigating.</em></p> <h1> AI #Programming #Github #Tutorial </h1>
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。