cassandra-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Jonathan Ellis (JIRA)" <>
Subject [jira] Updated: (CASSANDRA-16) Memory efficient compactions
Date Wed, 16 Jun 2010 13:36:45 GMT


Jonathan Ellis updated CASSANDRA-16:

    Attachment:     (was: 0006-make-row-size-at-which-to-drop-to-incremental-compacti.txt)

> Memory efficient compactions 
> -----------------------------
>                 Key: CASSANDRA-16
>                 URL:
>             Project: Cassandra
>          Issue Type: Improvement
>          Components: Core
>         Environment: All
>            Reporter: Sandeep Tata
>            Assignee: Jonathan Ellis
>             Fix For: 0.7
>         Attachments: 0001-introduce-AbstractCompactedRow-PrecompactedRow.txt, 0002-make-single-pass-over-columns-for-indexing.txt,
0003-r-m-object-count-abomination.-fix-BF-serialization-to-.txt, 0004-add-LazilyCompactedRow.txt,
0005-make-row-size-64-bits.txt, 0006-make-row-size-at-which-to-drop-to-incremental-compacti.txt,
> The basic idea is to allow rows to get large enough that they don't have to fit in memory
entirely, but can easily fit on a disk. The compaction algorithm today de-serializes the entire
row in memory before writing out the compacted SSTable (see ColumnFamilyStore.doCompaction()
and associated methods).
> The requirement is to have a compaction method with a lower memory requirement so we
can support rows larger than available main memory. To re-use the old FB example, if we stored
a user's inbox in a row, we'd want the inbox to grow bigger than memory so long as it fit
on disk.

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

View raw message