社区版本,单个node大小只能是20亿条,如果超过20亿条,就需要多个节点来配合,达到扩容的目的
新建hashMap
//初始化Aerospike路由配置
private HashMap<Integer, Integer> m_AerospikeNodeMap = new HashMap<Integer, Integer>() {
{
put(0, 0);
put(1, 0);
put(2, 1);
put(3, 1);
put(4, 2);
put(5, 2);
put(6, 1);
}
};
新建三个clinet分别插入不通的Aerospike中
//备选客户端初始化
private AerospikeClient m_AerospikeClient0 = new AerospikeClient(null, new Host("1.1.1.1", 3000),
new Host("1.1.1.1", 3000));
private AerospikeClient m_AerospikeClient1 = new AerospikeClient(null, new Host("1.1.1.2", 3000),
new Host("1.1.1.2", 3000));
private AerospikeClient m_AerospikeClient2 = new AerospikeClient(null, new Host("1.1.1.3", 3000),
new Host("1.1.1.3", 3000));
//根据key选择Client
Integer routeNumber = m_AerospikeNodeMap.get((keyForAerospike.toString().hashCode() & Integer.MAX_VALUE) % 6);
//写入Aerospike
if (routeNumber == 0) {
m_AerospikeClient0.put(policy, keyForAerospike, binForAerospike);
} else if (routeNumber == 1) {
m_AerospikeClient1.put(policy, keyForAerospike, binForAerospike);
} else {
m_AerospikeClient2.put(policy, keyForAerospike, binForAerospike);
}
}
这样利用hashCode就可以完成社区版本单节点20亿限制破解