How close can I bring vector search to where I actually need it?
I started building Itzma because I wanted to use it in my own projects. If an application needs to find the nearest vectors, can I make that a library call and keep the data in object storage? I wanted to see how far I could take that design and what I’d run into once I started using it myself.
Itzma is an open-source, embedded vector database written in Rust, with Python bindings. It’s still in beta.
The application runs the search
The application opens a namespace and queries it in-process. With an object storage backend, the bucket holds the durable data. There’s no separate vector database server to deploy.
That split raises a question I find more interesting than the initial setup. If two application processes write to the same namespace, what keeps them from overwriting each other’s changes? Itzma uses conditional writes from the object store to coordinate updates.…