Have 2 questions : 1. In RP on a given node, are the rows ordered by hash(key) or key ? If the rows on a node are ordered by hash(key) then essentially it has to be implemented by a full-scan on that node.
2. In RP, How does a cassandra node route a client's range-query request ? The range is distributed across the ring, so essentially either it send has to send the request to all nodes in the ring or just do a local processing. On Sat, Jul 7, 2012 at 7:47 PM, Edward Capriolo <edlinuxg...@gmail.com> wrote: > On Sat, Jul 7, 2012 at 9:26 AM, prasenjit mukherjee > <prasen....@gmail.com> wrote: >> Wondering how a rangequery request is handled if RP is used. Will the >> receiving node do a fan-out to all the nodes in the ring or it will >> just execute the rangequery on its own local partition ? >> >> -Prasenjit > > With RP the data is still ordered. It is ordered pseudo randomly. Like > all ranging scanning you can start with the null start row key for > your first range scan. Then for the next range scan use the last row > key from your results from the first scan.
