[
https://issues.apache.org/jira/browse/CASSANDRA-6933?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13948715#comment-13948715
]
Jonathan Ellis commented on CASSANDRA-6933:
-------------------------------------------
OTOH for the common case of "select *" [the Thrift equivalent anyway] either is
going to be worse than just linearly scanning from i.
If you really want to be optimal you should probably estimate the cost of
bsearch vs linear and say, "if the filter size is a large enough fraction of
the container size, use a linear SearchIterator, otherwise just use getColumn
bsearch."
> Optimise Read Comparison Costs in collectTimeOrderedData
> --------------------------------------------------------
>
> Key: CASSANDRA-6933
> URL: https://issues.apache.org/jira/browse/CASSANDRA-6933
> 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
(v6.2#6252)
