You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hbase.apache.org by "Andrew Purtell (JIRA)" <ji...@apache.org> on 2015/01/10 02:59:37 UTC

[jira] [Resolved] (HBASE-6371) [89-fb] Tier based compaction

     [ https://issues.apache.org/jira/browse/HBASE-6371?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Andrew Purtell resolved HBASE-6371.
-----------------------------------
    Resolution: Done

Resolved as Done

> [89-fb] Tier based compaction
> -----------------------------
>
>                 Key: HBASE-6371
>                 URL: https://issues.apache.org/jira/browse/HBASE-6371
>             Project: HBase
>          Issue Type: Improvement
>            Reporter: Akashnil
>            Assignee: Liyin Tang
>              Labels: beginner
>         Attachments: HBASE-6371-089fb-commit.patch, HBase_Tier_Base_Compaction.pdf
>
>
> Currently, the compaction selection is not very flexible and is not sensitive to the hotness of the data. Very old data is likely to be accessed less, and very recent data is likely to be in the block cache. Both of these considerations make it inefficient to compact these files as aggressively as other files. In some use-cases, the access-pattern is particularly obvious even though there is no way to control the compaction algorithm in those cases.
> In the new compaction selection algorithm, we plan to divide the candidate files into different levels according to oldness of the data that is present in those files. For each level, parameters like compaction ratio, minimum number of store-files in each compaction may be different. Number of levels, time-ranges, and parameters for each level will be configurable online on a per-column family basis.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)