-
Is there some recommendation about the key size, for example, |
Beta Was this translation helpful? Give feedback.
Replies: 2 comments
-
Highly dependent on project requirements. But if you expect large amount of entires consider partitioning your data into multiple keys. For example, instead of having one massive hash, you could shard the hash across multiple keys based on some part of the hash field |
Beta Was this translation helpful? Give feedback.
-
there is no standard answer. |
Beta Was this translation helpful? Give feedback.
there is no standard answer.
this depends on the real scenaro (commands used, memory, etc.)
a good way is to refer to the time complexity in https://redis.io/commands.
.e.g for a hash of 1 million entries, HGET (O(1)) and HGETALL (O(N)) have completely different performance.