Publisher
Unify application data, vectors, and full-text search in one Postgres
Do We Still Have to Denormalize? Have Your Schema and Search It Too
Stu Hood explains how ParadeDB handles relevance-sorted search and facet aggregations across joined Postgres tables, so teams no longer need to denormalize their schema into a separate search index, with benchmarks against plain Postgres.
14 min · 3,118 words
Making COUNTs and the Rest of Search Really Fast (Part II)
How ctid-aware segment partitioning, an inverted DocId map, and bitmap postings accelerated ParadeDB's Wikipedia COUNT queries, followed by a look at the rest of the text-search benchmark against PlanetScale's TIN.
13 min · 2,929 words
PlanetScale Released Text Search and We Have a Lot to Say (Part I)
Two BM25 optimizations and benchmark configuration changes inspired by PlanetScale's TIN benchmarks make ParadeDB's text search faster without changing its document identifiers.
14 min · 3,188 words
A Conversation with Paul Masurel, Creator of Tantivy
ParadeDB interviews Paul Masurel, creator of the Rust full-text search library Tantivy and co-founder of Quickwit, about building a search engine in Rust, chasing Lucene's performance, open-source maintenance, the Datadog acquisition, and advice for developers tackling 'solved' problems.
12 min · 2,751 words