[
https://issues.apache.org/jira/browse/CASSANDRA-1337?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Jonathan Ellis updated CASSANDRA-1337:
--------------------------------------
Description:
currently, we read the indexed rows from the first node (in partitioner order);
if that does not have enough matching rows, we read the rows from the next, and
so forth.
we should use the statistics fom CASSANDRA-1155 to query multiple nodes in
parallel, such that we have a high chance of getting enough rows w/o having to
do another round of queries (but, if our estimate is incorrect, we do need to
loop and do more rounds until we have enough data or we have fetched from each
node).
was:
currently, we read the indexed rows from the first node (in partitioner order);
if that does not have enough matching rows, we read the rows from the next, and
so forth.
we should use the statistics fom CASSANDRA-1155 to query multiple nodes in
parallel, such that we have a high chance of getting enough rows w/o having to
do another query (but, if our estimate is incorrect, we do need to loop and do
a 2nd query).
> parallelize fetching rows for low-cardinality indexes
> -----------------------------------------------------
>
> Key: CASSANDRA-1337
> URL: https://issues.apache.org/jira/browse/CASSANDRA-1337
> Project: Cassandra
> Issue Type: Improvement
> Reporter: Jonathan Ellis
> Priority: Minor
> Fix For: 0.7.1
>
>
> currently, we read the indexed rows from the first node (in partitioner
> order); if that does not have enough matching rows, we read the rows from the
> next, and so forth.
> we should use the statistics fom CASSANDRA-1155 to query multiple nodes in
> parallel, such that we have a high chance of getting enough rows w/o having
> to do another round of queries (but, if our estimate is incorrect, we do need
> to loop and do more rounds until we have enough data or we have fetched from
> each node).
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
