replikativ/proximum
Versioned, fast and scalable nearest neighbor search.
This is a high-performance vector database specifically for Clojure and Java applications that need to manage large collections of numerical data, often called embeddings or vectors. It allows you to store and search for the most similar items based on these vectors, like finding related documents or products. What's unique is its built-in 'time travel' and 'branching' features, letting you query past states of your data or experiment with different versions without copying everything. This is ideal for developers building search, recommendation, or AI-powered applications who need robust version control for their vector data.
Use this if you are a Java or Clojure developer building applications that require fast nearest neighbor searches on vector embeddings, and you need to track changes, experiment with different data versions, or maintain a historical record of your vector index.
Not ideal if you are looking for a simple, single-version vector store for extremely large indices (over 10 million vectors) where memory compression is your primary concern over version control.
Stars
20
Forks
—
Language
Clojure
License
Apache-2.0
Category
Last pushed
Mar 10, 2026
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/vector-db/replikativ/proximum"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
MariaDB/server
MariaDB server is a community developed fork of MySQL server. Started by core members of the...
AlayaDB-AI/AlayaLite
AlayaLite – A Fast, Flexible Vector Database for Everyone.
infiniflow/infinity
The AI-native database built for LLM applications, providing incredibly fast hybrid search of...
nnethercott/hannoy
Production-ready KV-backed HNSW implementation in Rust using LMDB
dingodb/dingo
A multi-modal vector database that supports upserts and vector queries using unified SQL...