Division is purely algorithmic. The system scales without a master and eliminates the need for additional configuration as required in a sharded environment.
Aerospike expert team,
I would like to study for a healthy aerospile cluster:
(A) on how the aerospike C client lib would divide (load balance) the ‘missing’ keys on the cluster nodes where it is a 8 node cluster with replication factor = 2 In case if a missing key, would the client attempt querying all the cluster nodes one by one?
(B) would there be chances of a miss for existing key; and would in that case, the query from the client would be internally transferred to the next cluster node)?
This is a generic question.