One key design of aerospike is using hash key to distribute requests evenly to all nodes in the cluster. As a HBase user, I think this is a good design to avoid hot point. But come with this design, the key are not stored physically in sequence and the scan will have to go though all keys of a set.
But from the Java Client API, I found range filter api like:
- range(String name, long begin, long end)
- range(String name, Value begin, Value end)
Wondering how range filter supported in a hash-key-store cluster.
- What is the start and end means here? Is it the origin key of record? How keys are compared? ( It need to be compared and sorted to have a sequence so that start and end can be used, right?)
- And how efficiently this range filter is? How could it works on a distributed-hash key set?