Perplexity’s CobbleDB explained | NeoTeo

Perplexity’s CobbleDB is a specialized distributed key-value store built to serve prepared web-page passages and vector embeddings during AI-search queries. In a technical account published on September 14, 2026, Perplexity reported that moving this part of its search-serving architecture away from Amazon DynamoDB reduced median batch-read latency from 31.4 ms to 5.60 ms.

The result is a database tuned for one job—not a universal replacement for every storage system Perplexity uses. Its design gives the company direct control over partitioning, caching, routing and replicas, while accepting a workload-specific consistency model and the responsibility of operating custom infrastructure.

Perplexity built CobbleDB for one demanding search workload

CobbleDB stores hashed page identifiers as keys. The associated values contain passages that have already been split into chunks, along with vector embeddings for each chunk. That preparation matters: when a search request arrives, the serving layer can retrieve many ready-to-use records instead of handling document processing and hot-path reads as one large operation.

Perplexity describes the system as a hot store for repeated batch reads. Cached records are served from memory; uncached records come from local NVMe storage through RocksDB, the embedded key-value engine used on CobbleDB’s data nodes.

The database handles selected production search traffic. Its role is narrower than a company-wide migration from DynamoDB, and…