ParadeDB

ParadeDB has raised a $12M Series A to bring Elasticsearch workloads to Postgres. Read it on TechCrunch: techcrunch.com/2025/07/15/par…

Today we open sourced @paradedb Benchmarker, a workload agnostic benchmarking runner built on top of @grafana #k6. Supports PostgreSQL, Elasticsearch, OpenSearch, ClickHouse, MongoDB, and ParadeDB. blog: paradedb.com/blog/what-we-t… repo: github.com/paradedb/bench…

@YingjunWu @ApacheDataFusio @RisingWaveLabs @ApacheSedona @tech_optimist @lancedb And the last but not the least. How @paradedb uses @ApacheDataFusio

ParadeDB and @Railway have teamed up to offer one-click deployments. paradedb.com/blog/railway

We’re proud to partner with Cofactr to power intelligent sourcing and search across their end-to-end electronics purchasing platform. paradedb.com/customers/case…

The ParadeDB project has officially reached one million Docker pulls. We're grateful to all our users and customers for the journey so far.

We’re proud to be partnering with @ModernTreasury to deliver fast, accurate search across their suite of money movement UIs and APIs. paradedb.com/customers/case…

Full-text search was solved in 2016, Lucene had owned the space for a decade. Rewriting it in Rust, as a side project, on a plane sounds like a terrible idea. But Paul Masurel (@fulmicoton) is a special kind of person. His side project became Tantivy, now a widely used (and very competitive) search library that's even helping improve Lucene. We sat down and talked about challenging solved domains, open-source competition done right, and why long-fermented frustration is an underrated driver. paradedb.com/blog/tantivy-i…

We're proud to partner with Terrapin to improve the search experience on their bond platform. paradedb.com/customers/case…

On March 31st, Stu Hood will be speaking about how ParadeDB performs native Top K JOINs at South Bay Systems. We look forward to seeing you there: luma.com/2g3exvjw?tk=29…

Top K is a deceptively hard problem in Postgres. "Give me the 10 best rows" works until you add filters and text search, then GIN can't sort and B-trees can't search. BM25 multi-column indexes handle equality, sort, and range in one data structure. Here's why that matters: paradedb.com/blog/optimizin…

ParadeDB is now supported on NixOS. #nix

It is now possible to reference the ParadeDB Skill directly via npx:

PradeDB now speaks ActiveRecord natively @paradedb github.com/paradedb/rails… No excuse for getting that full text search on Postgres now.

We're launching Agent Skills and MCP Server for ParadeDB. These will empower your AI coding agent to produce top-notch, accurate ParadeDB code effortlessly. For Skill, go to: github.com/paradedb/agent… For MCP:

Give me production search, but it's just Postgres (Supabase edition 👀) supabase.com/partners/integ…

@ankitml (ex-Instacart) shows us how to build personalized search entirely inside PostgreSQL. A search for “king” could mean LOTR: Return of the King or The King’s Speech, depending on a user’s genre preferences. His approach uses two steps: • Retrieve with BM25 • Rerank with embeddings + cosine similarity All in SQL. No external services. No data movement. paradedb.com/blog/personali…

As part of our v0.20.0 release late last year we did a lot of work on increasing write throughput. Adding any index to a Postgres table trades off write speed for read speed, and BM25 indexes aren't any exception. But because they map to immutable segments the impact can actually be a lot more than traditional indexes like Btree. So we set out to make things better .... paradedb.com/blog/increased…

Faceting looks simple, it's just counts next to search results right? But making it fast and ergonomic is harder than it seems. We just shipped native faceting in ParadeDB: runs inside Postgres, in a single pass, and is 14× faster over large result sets👇 paradedb.com/blog/faceting