mirror of
https://github.com/qdrant/landing_page.git
synced 2026-10-01 00:48:32 +02:00
Update qdrant-landing/content/articles/vector-similarity.md
Co-authored-by: Andrey Vasnetsov <andrey@vasnetsov.com>
This commit is contained in:
co-authored by
Andrey Vasnetsov
parent
fa82f22540
commit
5d6fc9d28d
@@ -149,7 +149,7 @@ The vector index in Qdrant employs the Hierarchical Navigable Small World (HNSW)
|
||||
|
||||
### **Scalability**
|
||||
|
||||
For massive datasets and demanding workloads, Qdrant supports [distributed deployment](https://qdrant.tech/documentation/guides/distributed_deployment) from v0.8.0. In this mode, you can set up a Qdrant cluster and distribute data across multiple nodes, enabling you to maintain high performance and availability even under increased workloads. Clusters support sharding and replication, and harness the Raft consensus algorithm to manage node coordination.
|
||||
For massive datasets and demanding workloads, Qdrant supports [distributed deployment](/documentation/guides/distributed_deployment) from v0.8.0. In this mode, you can set up a Qdrant cluster and distribute data across multiple nodes, enabling you to maintain high performance and availability even under increased workloads. Clusters support sharding and replication, and harness the Raft consensus algorithm to manage node coordination.
|
||||
|
||||
Qdrant also supports vector [quantization](https://qdrant.tech/documentation/guides/quantization/) to reduce memory footprint and speed up vector similarity searches, making it very effective for large-scale applications where efficient resource management is critical.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user