github/redis
1
1
Fork 0
mirror of https://github.com/redis/redis.git synced 2026-05-14 03:01:49 -04:00
Code Issues Packages Projects Releases Wiki Activity

README: grammar.

Browse Source
This commit is contained in:
antirez
2025-03-13 15:56:05 +01:00
parent 2fcf389f2a
commit 4e57d3f76f
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@@ -460,7 +460,7 @@ There are a few interesting facts to note about this pattern:
4. Insertions, so **write** queries, will be scaled linearly: I can add N items against N instances at the same time, splitting the insertion load evenly. This is very important since vector sets, being based on HNSW data structures, are slower to add items than to query similar items, by a very big factor.
5. While it cannot guarantee always the best results, with proper timeout management this system may be considered *highly available*, since if a subset of N instances are reachable, I'll be still be able to return similar items to my query vector.
Notably, this pattern can be implemented in order to avoid paying the sum of the round trip time with all the servers. It is possible to send the queries at the same time to all the instances, so that latency will equal the slower reply out of of the N servers queries.
Notably, this pattern can be implemented in a way that avoids paying the sum of the round trip time with all the servers: it is possible to send the queries at the same time to all the instances, so that latency will be equal the slower reply out of of the N servers queries.
# Vector Sets troubleshooting and understandability