cassandra-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Manoj Khangaonkar <>
Subject Re: Sorting keys for batch reads to minimize seeks
Date Thu, 17 Oct 2013 16:51:07 GMT
Unless I misunderstood your statement on sorting by row keys,

Cassandra partitions rows across nodes based on row keys. Sorting a random
set of keys will not help.
If you know that you set of keys are on a particular node , then sorting
might help. But I doubt that it is a sound practice, given that sets of
keys can be moved - as nodes are added or removed from the cluster


On Thu, Oct 17, 2013 at 9:40 AM, Artur Kronenberg <> wrote:

> Hi,
> I am looking to somehow increase read performance on cassandra. We are
> still playing with configurations but I was thinking if there would be
> solutions in software that might help us speed up our read performance.
> E.g. one idea, not sure how sane that is, was to sort read-batches by
> row-keys before submitting them to cassandra. The idea is that row-keys
> should be closer together on the physical disk and therefor this may
> minimize the amount of random seeks we have to do when querying say 1000
> entries from cassandra. Does that make any sense?
> Is there anything else that we can do in software to improve performance?
> Like specific batch sizes for reads? We are using the astyanax library to
> access cassandra.
> Thanks!


View raw message