new world spelling mistake
Signed-off-by: yuxiaobo <yuxiaobogo@163.com>
This commit is contained in:
parent
16370e6880
commit
7850f1b35c
|
@ -45,7 +45,7 @@ The directory structure of a Prometheus server's data directory will look someth
|
|||
|
||||
Note that a limitation of the local storage is that it is not clustered or replicated. Thus, it is not arbitrarily scalable or durable in the face of disk or node outages and should be treated as you would any other kind of single node database. Using RAID for disk availiablity, [snapshots](https://prometheus.io/docs/prometheus/latest/querying/api/#snapshot) for backups, capacity planning, etc, is recommended for improved durability. With proper storage durability and planning storing years of data in the local storage is possible.
|
||||
|
||||
Alternatively, external storage may be used via the [remote read/write APIs](https://prometheus.io/docs/operating/integrations/#remote-endpoints-and-storage). Careful evaluation is required for these systems as they vary greatly in durability, performance, and efficency.
|
||||
Alternatively, external storage may be used via the [remote read/write APIs](https://prometheus.io/docs/operating/integrations/#remote-endpoints-and-storage). Careful evaluation is required for these systems as they vary greatly in durability, performance, and efficiency.
|
||||
|
||||
For further details on file format, see [TSDB format](https://github.com/prometheus/prometheus/blob/master/tsdb/docs/format/README.md).
|
||||
|
||||
|
|
|
@ -163,7 +163,7 @@ func TestNoPanicFor0Tombstones(t *testing.T) {
|
|||
}
|
||||
|
||||
func TestLeveledCompactor_plan(t *testing.T) {
|
||||
// This mimicks our default ExponentialBlockRanges with min block size equals to 20.
|
||||
// This mimics our default ExponentialBlockRanges with min block size equals to 20.
|
||||
compactor, err := NewLeveledCompactor(context.Background(), nil, nil, []int64{
|
||||
20,
|
||||
60,
|
||||
|
|
|
@ -204,7 +204,7 @@ They are used to track label index sections. They are read into memory when an i
|
|||
### Postings Offset Table
|
||||
|
||||
A postings offset table stores a sequence of postings offset entries.
|
||||
Every postings offset entry holds the lable name/value pair and the offset to its series list in the postings section.
|
||||
Every postings offset entry holds the label name/value pair and the offset to its series list in the postings section.
|
||||
They are used to track postings sections. They are read into memory when an index file is loaded.
|
||||
|
||||
```
|
||||
|
|
Loading…
Reference in New Issue