cassandra-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Vijay (Commented) (JIRA)" <>
Subject [jira] [Commented] (CASSANDRA-3743) Lower memory consumption used by index sampling
Date Fri, 20 Jan 2012 05:23:40 GMT


Vijay commented on CASSANDRA-3743:

Wondering if we can use DecoratedKey[] instead of ArrayList in the attached patch... Just
my 2 cents (I noticed this while doing another patch).
> Lower memory consumption used by index sampling
> -----------------------------------------------
>                 Key: CASSANDRA-3743
>                 URL:
>             Project: Cassandra
>          Issue Type: Improvement
>          Components: Core
>    Affects Versions: 1.0.0
>            Reporter: Radim Kolar
>            Assignee: Radim Kolar
>              Labels: optimization
>             Fix For: 1.1
>         Attachments: cassandra-3743.txt
> currently is implemented as ArrayList of KeyPosition
(RowPosition key, long offset)i propose to change it to:
> RowPosition keys[]
> long offsets[]
> and use standard binary search on it. This will lower number of java objects used per
entry from 2 (KeyPosition + RowPosition) to 1 (RowPosition).
> For building these arrays convenient ArrayList class can be used and then call to .toArray()
on it.
> This is very important because index sampling uses a lot of memory on nodes with billions

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:!default.jspa
For more information on JIRA, see:


View raw message