I’m using the python client and was wondering if i’m doing the right calculations and about performance:
We need to have a “Sorted set” kind of functionality, that means we insert values to the key and we need query them sorted based on the value. (We want to get the TOP X, when inserting we want the set to be resorted according to the value).
We went ahead with “map” type. (The total number of objects in my map can reach 50K-1M objects)
I know keys in Aerospike have a limit of 10MB. so i wonder if my calc is correct here: Each “row” will have my useridentifier mapped to a score (float). so: Float = 4bytes (right?) + userIdentifier (string up to 50bytes) so for 1 map i’m limited to: 10MB (1048576 bytes) / (50+4) == 19418.0741 I’m limited to 19K objects in 1 map?
If that is the case - then i guess my option is to “Bucket” (split by key) But then i have performance issues that i need to insert into multiple keys and python seems to be very bad at that case… (or maybe i’m doing something wrong in my code , even though using asyncio )