cassandra-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Jonathan Ellis (JIRA)" <>
Subject [jira] [Commented] (CASSANDRA-6933) Optimise Read Comparison Costs in collectTimeOrderedData
Date Thu, 27 Mar 2014 00:42:14 GMT


Jonathan Ellis commented on CASSANDRA-6933:

I'm pretty sure "keep track of how many keys were skipped to satisfy last lookup" is a premature
optimization.  bsearch is logarithmic after all, so it doesn't take a whole lot of "oops we
were wrong, try again" to eat up the gains.

> Optimise Read Comparison Costs in collectTimeOrderedData
> --------------------------------------------------------
>                 Key: CASSANDRA-6933
>                 URL:
>             Project: Cassandra
>          Issue Type: Improvement
>          Components: Core
>            Reporter: Benedict
>            Assignee: Benedict
>            Priority: Minor
>              Labels: performance
>             Fix For: 2.1
> Introduce a new SearchIterator construct, which can be obtained from a ColumnFamily,
which permits efficiently iterating a subset of the cells in ascending order. Essentially,
it saves the previously visited position and searches from there, but also tries to avoid
searching the whole remaining space if possible.

This message was sent by Atlassian JIRA

View raw message