Grafana Mimir compactor
The compactor increases query performance and reduces long-term storage usage by combining blocks.
The compactor is the component responsible for:
- Compacting multiple blocks of a given tenant into a single, optimized larger block. This deduplicates chunks and reduces the size of the index, resulting in reduced storage costs. Querying fewer blocks is faster, so it also increases query speed.
- Keeping the per-tenant bucket index updated. The bucket index is used by queriers, store-gateways, and rulers to discover both new blocks and deleted blocks in the storage.
- Deleting blocks that are no longer within a configurable retention period.
The compactor is stateless.
How compaction works
Compaction occurs on a per-tenant basis.
The compactor runs at regular, configurable intervals.
Vertical compaction merges all the blocks of a tenant uploaded by ingesters for the same time range (2 hours ranges by default) into a single block. It also deduplicates samples that were originally written to N blocks as a result of replication. Vertical compaction reduces the number of blocks for a single time range from the quantity of ingesters down to one block per tenant.
Horizontal compaction triggers after a vertical compaction. It compacts several blocks with adjacent range periods into a single larger block. The total size of the associated block chunks does not change after horizontal compaction. The horizontal compaction may significantly reduce the size of the index and the index-header kept in memory by store-gateways.
Compaction can be tuned for clusters with large tenants. Configuration specifies both vertical and horizontal scaling of how the compactor runs as it compacts on a per-tenant basis.
- Vertical scaling
-compactor.compaction-concurrencyconfigures the max number of concurrent compactions running in a single compactor instance. Each compaction uses one CPU core.
- Horizontal scaling
By default, tenant blocks can be compacted by any Grafana Mimir compactor. When you enable compactor shuffle sharding by setting
-compactor.compactor-tenant-shard-size(or its respective YAML configuration option) to a value higher than
0and lower than the number of available compactors, only the specified number of compactors are eligible to compact blocks for a given tenant.
Mimir uses a sophisticated compaction algorithm called split-and-merge.
By design, the split-and-merge algorithm overcomes time series database (TSDB) index limitations, and it avoids situations in which compacted blocks grow indefinitely for a very large tenant at any compaction stage.
This compaction strategy is a two-stage process: split and merge. The default configuration disables the split stage.
To split, the first level of compaction, for example
2h, the compactor divides all source blocks into N (
-compactor.split-groups) groups. For each group, the compactor compacts the blocks, but instead of producing a single result block, it outputs M (
-compactor.split-and-merge-shards) blocks, known as split blocks. Each split block contains only a subset of the series belonging to a given shard out of M shards. At the end of the split stage, the compactor produces N * M blocks with a reference to their respective shard in the block’s
The compactor merges the split blocks for each shard. This compacts all N split blocks of a given shard. The merge reduces the number of blocks from N * M to M. For a given compaction time range, there will be a compacted block for each of the M shards.
The merge then runs on other configured compaction time ranges, for example 12h and 24h. It compacts blocks belonging to the same shard.
This strategy is suitable for clusters with large tenants. The number of shards M is configurable on a per-tenant basis using
-compactor.split-and-merge-shards, and it can be adjusted based on the number of series of each tenant. The more a tenant grows in terms of series, the more you can grow the configured number of shards. Doing so improves compaction parallelization and keeps each per-shard compacted block size under control. We currently recommend 1 shard per every 25 to 30 million active series in a tenant. For example, for a tenant with 100 million active series, use approximately 4 shards.
The number of split groups, N, can also be adjusted per tenant using the
-compactor.split-groups option. Increasing this value produces more compaction jobs with fewer blocks during the split stage. This allows multiple compactors to work on these jobs, and finish the splitting stage faster. However, increasing this value also generates more intermediate blocks during the split stage, which will only be reduced later in the merge stage.
If the configuration of
-compactor.split-and-merge-shards changes during compaction, the change will affect only the compaction of blocks which have not yet been split. Already split blocks will use the original configuration when merged.. The original configuration is stored in the
meta.json of each split block.
Splitting and merging can be horizontally scaled. Nonconflicting and nonoverlapping jobs will be executed in parallel.
The compactor shards compaction jobs, either from a single tenant or multiple tenants. The compaction of a single tenant can be split and processed by multiple compactor instances.
Whenever the pool of compactors grows or shrinks, tenants and jobs are resharded across the available compactor instances without any manual intervention.
Compactor sharding uses a hash ring. At startup, a compactor generates random tokens and registers itself to the compactor hash ring. While running, it periodically scans the storage bucket at every interval defined by
-compactor.compaction-interval, to discover the list of tenants in storage and compact blocks for each tenant which hash matches the token ranges assigned to the instance itself within the hash ring.
To configure the compactors’ hash ring, refer to configuring hash rings.
Waiting for a stable hash ring at startup
A cluster cold start or an increase of two or more compactor instances at the same time may result each new compactor instance starting at a slightly different time. Then, each compactor runs its first compaction based on a different state of the hash ring. This is not an error condition, but it may be inefficient, because multiple compactor instances may start compacting the same tenant at nearly the same time.
To mitigate the issue, compactors can be configured to wait for a stable hash ring at startup. A ring is considered stable if no instance is added to or removed from the hash ring for at least
-compactor.ring.wait-stability-min-duration. The maximum time the compactor will wait is controlled by the flag
-compactor.ring.wait-stability-max-duration (or the respective YAML configuration option). Once the compactor has finished waiting, either because the ring stabilized or because the maximum wait time was reached, it will start up normally.
The default value of zero for
-compactor.ring.wait-stability-min-duration disables waiting for ring stability.
Compaction jobs order
The compactor allows configuring of the compaction jobs order via the
-compactor.compaction-jobs-order flag (or its respective YAML config option). The configured ordering defines which compaction jobs should be executed first. The following values of
-compactor.compaction-jobs-order are supported:
This ordering gives priority to smallest range, oldest blocks first.
For example, with compaction ranges
2h, 12h, 24h, the compactor will compact the 2h ranges first, and among them give priority to the oldest blocks. Once all blocks in the 2h range have been compacted, it moves to the 12h range, and finally to 24h one.
All split jobs are moved to the front of the work queue, because finishing all split jobs in a given time range unblocks the merge jobs.
This ordering gives priority to the most recent time ranges first, regardless of their compaction level.
For example, with compaction ranges
2h, 12h, 24h, the compactor compacts the most recent blocks first (up to the 24h range), and then moves to older blocks. This policy favours the most recent blocks, assuming they are queried the most frequently.
Following a successful compaction, the original blocks are deleted from the storage. Block deletion is not immediate; it follows a two step process:
- An original block is marked for deletion; this is a soft delete
- Once a block has been marked for deletion for longer than the configurable
-compactor.deletion-delay, the block is deleted from storage; this is a hard delete
The compactor is responsible for both marking blocks and for hard deletion.
Soft deletion is based on a small
deletion-mark.json file stored within the block location in the bucket.
The soft delete mechanism gives time to queriers, rulers, and store-gateways to discover the new compacted blocks before the original blocks are deleted. If those original blocks were immediately hard deleted, some queries involving the compacted blocks could temporarily fail or return partial results.
Compactor disk utilization
The compactor needs to download blocks from the bucket to the local disk, and the compactor needs to store compacted blocks to the local disk before uploading them to the bucket. The largest tenants may need a lot of disk space.
max_compaction_range_blocks_size is the total block size for the largest tenant during the longest
-compactor.block-ranges period, the expression that estimates the minimum disk space required is:
compactor.compaction-concurrency * max_compaction_range_blocks_size * 2
Alternatively, assuming the largest
24h (the default), you could estimate needing 150GB of disk space for every 10M active series owned by the largest tenant. For example, if your largest tenant has 30M active series and
-compactor.compaction-concurrency=1, we would recommend having a disk with at least 450GB available.
The alertmanager and ruler components can also use object storage to store their configurations and rules uploaded by users. In that case a separate bucket should be created to store alertmanager configurations and rules: using the same bucket between ruler/alertmanager and blocks will cause issues with the compactor.