krzysztof/landing_page
1
0
Fork 0
mirror of https://github.com/qdrant/landing_page.git synced 2026-09-25 22:18:30 +02:00
Code Issues Packages Projects Releases Wiki Activity

adjusting content issues

Browse Source
This commit is contained in:
sabrinaaquino
2024-01-29 18:45:07 -03:00
parent aff8a7c49d
commit 84867cf495
1 changed files with 0 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
qdrant-landing/content/articles/what-is-a-vector-database.md
-4
View File
@@ -130,11 +130,7 @@ Once the closest vectors are identified at the bottom layer, these points transl
### Scalability
<<<<<<< HEAD:qdrant-landing/content/articles/what-is-a-vector-database.md
Vector databases often deal with datasets that comprise billions of high-dimensional vectors. This data isn't just large in volume but also complex in nature, requiring more computing power and memory to process. Scalable systems can handle this increased complexity without performance degradation. This is achieved through a combination of a **distributed architecture**, **dynamic resource allocation**, **data partitioning**, **load balancing**, and **optimization techniques**.
=======
Vector databases often deal with datasets that comprise billions of high-dimensional vectors. This data isn't just large in volume but also complex in nature, requiring more computing power and memory to process. Scalable systems can handle this increased complexity without performance degradation. This is achieved through a combination of a **distributed architecture**, **dynamic resource allocation**, **data partitioning**, **load balancing**, and **optimization techniques**.
>>>>>>> master:qdrant-landing/content/blog/what-is-a-vector-database.md
Systems like Qdrant exemplify scalability in vector databases. It leverages Rust's efficiency in **memory management** and **performance**, which allows handling of large-scale data with optimized resource usage.