cassandra-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Stu Hood (JIRA)" <>
Subject [jira] Commented: (CASSANDRA-2062) Use more efficient merge algorithm
Date Thu, 27 Jan 2011 09:27:44 GMT


Stu Hood commented on CASSANDRA-2062:

The times in that paste aren't supposed to be significant... I was just trying to get the
count of comparisons, so I was doing other things with my laptop. That test uses very small
keys (<6 bytes), so the comparisons are relatively cheap. 

> Use more efficient merge algorithm
> ----------------------------------
>                 Key: CASSANDRA-2062
>                 URL:
>             Project: Cassandra
>          Issue Type: Improvement
>          Components: Core
>            Reporter: Stu Hood
>            Priority: Minor
>             Fix For: 0.7.2
>         Attachments: 0001-Improved-iterator-for-merging-sorted-iterators.txt, 0002-Quickie-instrumentation-for-comparisons.txt,
0003-Replace-Collating-with-Merge-in-CompactionIterator.txt, 0004-Port-LazilyCompactedRow-ReducingKeyIterator-RangeSlice.txt,
> For {{M}} iterators containing {{N}} total items, commons.collections.CollatingIterator
performs a {{O(M*N)}} merge, and calls hasNext multiple times per returned value. We can do

This message is automatically generated by JIRA.
You can reply to this email to add a comment to the issue online.

View raw message