mirror of
https://github.com/prometheus/prometheus.git
synced 2024-09-20 07:47:31 -07:00
b3e34c6658
This commit introduces to Prometheus a batch database sample curator, which corroborates the high watermarks for sample series against the curation watermark table to see whether a curator of a given type needs to be run. The curator is an abstract executor, which runs various curation strategies across the database. It remarks the progress for each type of curation processor that runs for a given sample series. A curation procesor is responsible for effectuating the underlying batch changes that are request. In this commit, we introduce the CompactionProcessor, which takes several bits of runtime metadata and combine sparse sample entries in the database together to form larger groups. For instance, for a given series it would be possible to have the curator effectuate the following grouping: - Samples Older than Two Weeks: Grouped into Bunches of 10000 - Samples Older than One Week: Grouped into Bunches of 1000 - Samples Older than One Day: Grouped into Bunches of 100 - Samples Older than One Hour: Grouped into Bunches of 10 The benefits hereof of such a compaction are 1. a smaller search space in the database keyspace, 2. better employment of compression for repetious values, and 3. reduced seek times.
77 lines
2.2 KiB
Go
77 lines
2.2 KiB
Go
// Copyright 2013 Prometheus Team
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package storage
|
|
|
|
// RecordDecoder decodes each key-value pair in the database. The protocol
|
|
// around it makes the assumption that the underlying implementation is
|
|
// concurrency safe.
|
|
type RecordDecoder interface {
|
|
DecodeKey(in interface{}) (out interface{}, err error)
|
|
DecodeValue(in interface{}) (out interface{}, err error)
|
|
}
|
|
|
|
// FilterResult describes the record matching and scanning behavior for the
|
|
// database.
|
|
type FilterResult int
|
|
|
|
const (
|
|
// Stop scanning the database.
|
|
STOP FilterResult = iota
|
|
// Skip this record but continue scanning.
|
|
SKIP
|
|
// Accept this record for the Operator.
|
|
ACCEPT
|
|
)
|
|
|
|
func (f FilterResult) String() string {
|
|
switch f {
|
|
case STOP:
|
|
return "STOP"
|
|
case SKIP:
|
|
return "SKIP"
|
|
case ACCEPT:
|
|
return "ACCEPT"
|
|
}
|
|
|
|
panic("unknown")
|
|
}
|
|
|
|
type OperatorErrorType int
|
|
|
|
type OperatorError struct {
|
|
error
|
|
Continuable bool
|
|
}
|
|
|
|
// Filter is responsible for controlling the behavior of the database scan
|
|
// process and determines the disposition of various records.
|
|
//
|
|
// The protocol around it makes the assumption that the underlying
|
|
// implementation is concurrency safe.
|
|
type RecordFilter interface {
|
|
// Filter receives the key and value as decoded from the RecordDecoder type.
|
|
Filter(key, value interface{}) (filterResult FilterResult)
|
|
}
|
|
|
|
// RecordOperator is responsible for taking action upon each entity that is
|
|
// passed to it.
|
|
//
|
|
// The protocol around it makes the assumption that the underlying
|
|
// implementation is concurrency safe.
|
|
type RecordOperator interface {
|
|
// Take action on a given record. If the action returns an error, the entire
|
|
// scan process stops.
|
|
Operate(key, value interface{}) (err *OperatorError)
|
|
}
|