mirror of
https://github.com/VictoriaMetrics/VictoriaMetrics.git
synced 2024-11-27 02:46:47 +01:00
202eb429a7
It has been appeared that VictoriaLogs is frequently used for collecting logs with tens of fields. For example, standard Kuberntes setup on top of Filebeat generates more than 20 fields per each log. Such logs are also known as "wide events". The previous storage format was optimized for logs with a few fields. When at least a single field was referenced in the query, then the all the meta-information about all the log fields was unpacked and parsed per each scanned block during the query. This could require a lot of additional disk IO and CPU time when logs contain many fields. Resolve this issue by providing an (field -> metainfo_offset) index per each field in every data block. This index allows reading and extracting only the needed metainfo for fields used in the query. This index is stored in columnsHeaderIndexFilename ( columns_header_index.bin ). This allows increasing performance for queries over wide events by 10x and more. Another issue was that the data for bloom filters and field values across all the log fields except of _msg was intermixed in two files - fieldBloomFilename ( field_bloom.bin ) and fieldValuesFilename ( field_values.bin ). This could result in huge disk read IO overhead when some small field was referred in the query, since the Operating System usually reads more data than requested. It reads the data from disk in at least 4KiB blocks (usually the block size is much bigger in the range 64KiB - 512KiB). So, if 512-byte bloom filter or values' block is read from the file, then the Operating System reads up to 512KiB of data from disk, which results in 1000x disk read IO overhead. This overhead isn't visible for recently accessed data, since this data is usually stored in RAM (aka Operating System page cache), but this overhead may become very annoying when performing the query over large volumes of data which isn't present in OS page cache. The solution for this issue is to split bloom filters and field values across multiple shards. This reduces the worst-case disk read IO overhead by at least Nx where N is the number of shards, while the disk read IO overhead is completely removed in best case when the number of columns doesn't exceed N. Currently the number of shards is 8 - see bloomValuesShardsCount . This solution increases performance for queries over large volumes of newly ingested data by up to 1000x. The new storage format is versioned as v1, while the old storage format is version as v0. It is stored in the partHeader.FormatVersion. Parts with the old storage format are converted into parts with the new storage format during background merge. It is possible to force merge by querying /internal/force_merge HTTP endpoint - see https://docs.victoriametrics.com/victorialogs/#forced-merge .
55 lines
1.1 KiB
Go
55 lines
1.1 KiB
Go
package logstorage
|
|
|
|
import (
|
|
"reflect"
|
|
"testing"
|
|
)
|
|
|
|
func TestMarshalUnmarshalColumnNames(t *testing.T) {
|
|
f := func(columnNames []string) {
|
|
t.Helper()
|
|
|
|
data := marshalColumnNames(nil, columnNames)
|
|
result, err := unmarshalColumnNames(data)
|
|
if err != nil {
|
|
t.Fatalf("unexpected error when unmarshaling columnNames: %s", err)
|
|
}
|
|
if !reflect.DeepEqual(columnNames, result) {
|
|
t.Fatalf("unexpected umarshaled columnNames\ngot\n%v\nwant\n%v", result, columnNames)
|
|
}
|
|
}
|
|
|
|
f([]string{})
|
|
|
|
f([]string{"", "foo", "bar"})
|
|
|
|
f([]string{
|
|
"asdf.sdf.dsfds.f fds. fds ",
|
|
"foo",
|
|
"bar.sdfsdf.fd",
|
|
"",
|
|
"aso apaa",
|
|
})
|
|
}
|
|
|
|
func TestColumnNameIDGenerator(t *testing.T) {
|
|
a := []string{"", "foo", "bar.baz", "asdf dsf dfs"}
|
|
|
|
g := &columnNameIDGenerator{}
|
|
|
|
for i, s := range a {
|
|
id := g.getColumnNameID(s)
|
|
if id != uint64(i) {
|
|
t.Fatalf("first run: unexpected id generated for s=%q; got %d; want %d; g=%v", s, id, i, g)
|
|
}
|
|
}
|
|
|
|
// Repeat the loop
|
|
for i, s := range a {
|
|
id := g.getColumnNameID(s)
|
|
if id != uint64(i) {
|
|
t.Fatalf("second run: unexpected id generated for s=%q; got %d; want %d; g=%v", s, id, i, g)
|
|
}
|
|
}
|
|
}
|