mirror of
https://github.com/VictoriaMetrics/VictoriaMetrics.git
synced 2024-12-11 14:53:49 +00:00
93 lines
2.5 KiB
Go
93 lines
2.5 KiB
Go
package storage
|
|
|
|
import (
|
|
"time"
|
|
)
|
|
|
|
// SetMinScrapeIntervalForDeduplication sets the minimum interval for data points during de-duplication.
|
|
//
|
|
// De-duplication is disabled if interval is 0.
|
|
//
|
|
// This function must be called before initializing the storage.
|
|
func SetMinScrapeIntervalForDeduplication(interval time.Duration) {
|
|
minScrapeInterval = interval.Milliseconds()
|
|
}
|
|
|
|
var minScrapeInterval = int64(0)
|
|
|
|
// DeduplicateSamples removes samples from src* if they are closer to each other than minScrapeInterval.
|
|
func DeduplicateSamples(srcTimestamps []int64, srcValues []float64) ([]int64, []float64) {
|
|
if minScrapeInterval <= 0 {
|
|
return srcTimestamps, srcValues
|
|
}
|
|
if !needsDedup(srcTimestamps, minScrapeInterval) {
|
|
// Fast path - nothing to deduplicate
|
|
return srcTimestamps, srcValues
|
|
}
|
|
|
|
// Slow path - dedup data points.
|
|
tsNext := (srcTimestamps[0] - srcTimestamps[0]%minScrapeInterval) + minScrapeInterval
|
|
dstTimestamps := srcTimestamps[:1]
|
|
dstValues := srcValues[:1]
|
|
for i := 1; i < len(srcTimestamps); i++ {
|
|
ts := srcTimestamps[i]
|
|
if ts < tsNext {
|
|
continue
|
|
}
|
|
dstTimestamps = append(dstTimestamps, ts)
|
|
dstValues = append(dstValues, srcValues[i])
|
|
|
|
// Update tsNext
|
|
tsNext += minScrapeInterval
|
|
if ts >= tsNext {
|
|
// Slow path for updating ts.
|
|
tsNext = (ts - ts%minScrapeInterval) + minScrapeInterval
|
|
}
|
|
}
|
|
return dstTimestamps, dstValues
|
|
}
|
|
|
|
func deduplicateSamplesDuringMerge(srcTimestamps, srcValues []int64) ([]int64, []int64) {
|
|
if minScrapeInterval <= 0 {
|
|
return srcTimestamps, srcValues
|
|
}
|
|
if !needsDedup(srcTimestamps, minScrapeInterval) {
|
|
// Fast path - nothing to deduplicate
|
|
return srcTimestamps, srcValues
|
|
}
|
|
|
|
// Slow path - dedup data points.
|
|
tsNext := (srcTimestamps[0] - srcTimestamps[0]%minScrapeInterval) + minScrapeInterval
|
|
dstTimestamps := srcTimestamps[:1]
|
|
dstValues := srcValues[:1]
|
|
for i := 1; i < len(srcTimestamps); i++ {
|
|
ts := srcTimestamps[i]
|
|
if ts < tsNext {
|
|
continue
|
|
}
|
|
dstTimestamps = append(dstTimestamps, ts)
|
|
dstValues = append(dstValues, srcValues[i])
|
|
|
|
// Update tsNext
|
|
tsNext += minScrapeInterval
|
|
if ts >= tsNext {
|
|
// Slow path for updating ts.
|
|
tsNext = (ts - ts%minScrapeInterval) + minScrapeInterval
|
|
}
|
|
}
|
|
return dstTimestamps, dstValues
|
|
}
|
|
|
|
func needsDedup(timestamps []int64, minDelta int64) bool {
|
|
if len(timestamps) == 0 {
|
|
return false
|
|
}
|
|
prevTimestamp := timestamps[0]
|
|
for _, ts := range timestamps[1:] {
|
|
if ts-prevTimestamp < minDelta {
|
|
return true
|
|
}
|
|
prevTimestamp = ts
|
|
}
|
|
return false
|
|
}
|