partition search is not faster than collection search #35529
Replies: 3 comments 5 replies
-
the reason is that you are using strong consistency. So a search need to wait around 200ms. Remove the strong consistency limit and you will see both search takes < 10ms |
Beta Was this translation helpful? Give feedback.
-
and use partiton search will help on QPS. since the data is not huge I don't believe there will be a big difference on latency. |
Beta Was this translation helpful? Give feedback.
-
Make clear some points:
|
Beta Was this translation helpful? Give feedback.
-
I have a scenario and my data size is 2M vectors of size 512. Then I generate collection with 2 partitions male and female. They are approximately same size:
Collection parameters:
code for search on partition:
code for search on collection:
I'd like to search in specific partition, as these partitions have half size of the collection, I think that search on male partition should be faster than search on collection. But results show another thing(search on male or female is not too faster than the collection):
bellow I bring code for more inspection:
Beta Was this translation helpful? Give feedback.
All reactions