[
https://issues.apache.org/jira/browse/CASSANDRA-71?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12704568#action_12704568
]
Hudson commented on CASSANDRA-71:
---------------------------------
Integrated in Cassandra #53 (See
[http://hudson.zones.apache.org/hudson/job/Cassandra/53/])
Add range query support, which requires using an
OrderPreservingPartitioner. (Keys are returned in the order defined by the
partitioner collation.) The fundamental approach (in table.getKeyRange) is
simple: create a CollatedIterator that will return unique keys from different
sources, each of which is already sorted. Then we just need Iterators for
different key sources. For SSTables, this means adding seekTo and an Iterator
interface to FileStruct. For Memtable, this means adding a
DestructivePQIterator since unlike SSTable keys those are not inherently
ordered already. This means that we only do M log N work sorting the memtable
keys where M is the number of keys we actually read, and N is the total number
of keys, where a naive sort-everything-first iterator would be N log N.
This does not yet implement range queries spanning multiple nodes.
patch by jbellis; reviewed by Jun Rao for
> Range query support
> -------------------
>
> Key: CASSANDRA-71
> URL: https://issues.apache.org/jira/browse/CASSANDRA-71
> Project: Cassandra
> Issue Type: New Feature
> Reporter: Jonathan Ellis
> Assignee: Jonathan Ellis
> Fix For: 0.3
>
> Attachments: 71-close.patch, 71.patch
>
>
> Scan for keys by range (between X and Y) or prefix (starting with P).
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
