Engineering posts, retrieval research, and customer dispatches from the team building vector search around the questions you actually ask.
Two small kernels, a lot of lanes, and one reminder that wider does not automatically mean faster.
Why we built SABLE, a filter-native retrieval engine designed around selectivity from the beginning.
Most vector databases bolt filtering on after the fact. Production SABLE uses filter-native planning, graph-free ADC over compressed vectors, and exact reranking to keep filtered search fast.
Graph-based vector search sounds intimidating, but the core idea is elegant. NSG builds a sparse, well-spread graph that lets you navigate to any nearest neighbor in a handful of hops.
Every memory-first vector database is announcing disk support. But bolt-on tiering solves a cost problem. It does not resolve the latency, write-throughput, and filtered-query problems that disk-resident workloads actually surface in production.
IVF-PQ is the workhorse of large-scale vector search. OPQ makes it dramatically better by learning a rotation that aligns your data with the quantizer. Here's how both work and why OPQ's trick is so clever.