Databricks' Lakebase Search moves Postgres vector indexes from RAM into object storage

Databricks starts its case with pgvector's memory model. By its count, a 768-dimension float32 vector needs about 3.3 KB once HNSW graph links and Postgres overhead are included, so 100 million rows need roughly 330 GB of RAM to keep the index resident ^[11]. When the index spills to disk, Databricks says, queries slow by 10x to 50x ^[24]. HNSW has no global rebalancing, so restoring search quality takes a full REINDEX that locks the table and blocks writes ^[12]. Each query also runs in one backend process, and the index scan is never parallelized ^[13]. Databricks is grading an index it now competes with, though pgvector is also the most installed extension on its own platform ^[15].

The design follows from where Lakebase keeps data. Durable data sits in object storage, with RAM and local NVMe acting as caches in front of it. On that layout, Databricks writes, HNSW search means a series of random object store reads ^[5]. lakebase_vector uses hierarchical IVF to narrow each search to a small set of clusters, and RaBitQ quantization to compress vectors so more of the index fits in the cache layers ^[3]. The durable index stays in object storage ^[2]. I think IVF is the right choice for a database built this way. A cache in front of object storage handles a few cluster reads better than a chain of random hops through a graph.

Scale to zero is the piece of engineering I would credit first. When compute suspends, the index stays in object storage, and returning traffic reconnects to the same index instead of rebuilding it ^[4]. By Databricks' own figure, a pgvector index build that spills to disk takes almost 50 hours on a standard cloud instance ^[25].

The headline benchmark is a VectorDBBench run that Neon says used LAION-100M ^[20]. Databricks reports twice the throughput of the next best system, and sets the fourfold cost saving against "a cloud Postgres vendor using pgvector", before any autoscaling savings ^[19]. It reports P99 latency of 71 milliseconds at 97% recall ^[21]. That leaves about 3 in every 100 true nearest neighbors unreturned ^[17].

For the result to transfer, a corpus has to be large enough that an HNSW index would spill out of RAM. The recall target has to sit near 97%. Queries also have to keep hitting a working set small enough to stay cached. Databricks' per-vector figure puts a 10-million-row index near 33 GB ^[18], and at that size I'd expect pgvector's spill penalty to matter much less.

Hybrid search is plain SQL. An application combines vector and keyword results in one query ^[10]. Neon's example wraps that query in a Function that the agent calls as one tool, and the call returns ranked passages with their sources ^[16]. The Neon post does not say how the two rankings are merged into a single order.

Jordan Voves, an AI/ML architect at Conexiom, said in the Databricks post: "Lakebase Search gives us a whole new level of scalability over pgvector, and unlocks BM25 in the same serverless database. We use Lakebase to connect data to our agents at scale." ^[23]