Blog.
Deep dives into search, retrieval, and what we’re building.
The Fastest Regex Is the One You Don’t Run
Why AI agents reach for regex search, and how TopK uses sparse n-grams to make those queries fast.
FROM THE TEAM
Recent posts
RAG Is Broken for Agents. Here's How We Fixed It.
Context is a search problem. Without the right context, even the best models fail. This post describes why dense embedding based RAG is broken for agents and how multi-vector (late interaction) retrieval fixes it.
TopK SQL: A Search Query Language
TopK now implements the Postgres wire protocol, so any Postgres client can run semantic search, hybrid search, and filtered retrieval as ordinary SQL.
High-Quality Search, Out of the Box
TopK's semantic_index annotation brings state-of-the-art multi-vector retrieval to production — no embedding pipeline, no separate vector store, no reranking service.
SMVE: Multi-Vector Retrieval That Just Works
TopK introduces SMVE, a fast and scalable approach to late-interaction retrieval based on sparse random projections.
TopK Bench: Benchmarking Real-World Vector Search
This post evaluates how managed vector databases handle large-scale, production-like workloads—including millions of vectors, concurrent querying, real-world filtering, and continuous ingestion—using reproducible benchmarks across several leading providers.
[Podcast] Building a Search Database from First Principles
Listen to our founder Marek Galovic discuss the challenges and solutions in building a search database from the ground up, covering everything from vector search to hybrid retrieval and the architectural decisions that shaped TopK.
Beyond RRF: How TopK Improves Hybrid Search by up to 7.8%
A case study on how TopK hybrid retrieval outperforms traditional RRF-based methods, improving nDCG@10 by an average of 4.5% (and up to 7.8% on some datasets) by leveraging score-aware ranking, dynamic weighting, and efficient result merging.
Scaling Without Complexity: Billion-Scale Hybrid Search with TopK
TopK enables billion-scale hybrid search with <100ms latency, fast indexing, and high-quality results.
Binary Vector Search at 350GB/s using ARM NEON
Optimizing binary vector search using ARM NEON instructions to achieve 350GB/s throughput.
We Raised $5.5 Million to build an AI-Native Search Engine for Enterprises
TopK has raised $5.5 million in seed funding to accelerate the development of its unified, AI-native search platform, enabling organizations to seamlessly combine vector, keyword, and custom ranking in a single system. The round was led by top-tier investors, fueling our mission to redefine search for the AI era.
TopK at Data Council AI Launchpad 2025
At Data Council 2025, we introduced TopK, a unified cloud-native query engine that combines vector search, keyword matching, and flexible scoring in a single system. We demonstrated how TopK overcomes the limitations of traditional vector databases by supporting hybrid queries with custom ranking logic while maintaining high performance.
Why Vector DBs Are the Wrong Abstraction – And What We Built Instead
We’ve spent the last three years building the most popular vector database on the market. In that time we realized that a database built around vectors as a primary key is simply the wrong abstraction, creating an unnecessary obstacle for users in production.
Ship better
search today.
Build on flexible primitives and focus on
what makes your beer taste better.












