datastax/jvector

Health v2 · maintenance only

Adoption not part of the score

1741 stars · 158 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

JVector is an embedded approximate nearest neighbor (ANN) search engine for the JVM, implementing a graph index that merges HNSW's hierarchical structure with DiskANN's Vamana algorithm. It supports incremental, concurrent index construction and two-pass searches combining in-memory compressed vectors (PQ, BQ) with on-disk full-resolution vectors.

Use cases

• add vector similarity search to a Java application
• build an embedded ANN index without running a separate vector database
• search embeddings at scale with memory-efficient quantization
• incrementally update a vector index as new data arrives
• perform disk-backed nearest neighbor search over large datasets
• power semantic search or RAG retrieval in a JVM service

When to choose

• you need high-performance vector search embedded in a Java/JVM application
• you want incremental index updates rather than static batch-built indexes
• your dataset is too large to keep all full-resolution vectors in memory
• you need concurrent, multi-threaded index construction

When to avoid

• you need a standalone vector database with a query API rather than an embedded library
• your stack is not on the JVM
• you require exact (non-approximate) nearest neighbor results
• you need multi-modal indexes or built-in persistence/replication features of full databases

Facets

library · maturity active

search-engine vector-database machine-learning databases machine-learning jvm cross-platform ann knn similarity-search hnsw diskann vamana product-quantization embedded vector-search search algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="datastax/jvector")