-
Notifications
You must be signed in to change notification settings - Fork 0
/
store.go
221 lines (204 loc) · 5.02 KB
/
store.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
package store
import (
"context"
"errors"
"sync/atomic"
"github.com/cenkalti/backoff/v4"
"github.com/cespare/xxhash/v2"
"github.com/dgraph-io/badger/v4"
"github.com/dgraph-io/ristretto"
v1 "github.com/gernest/requiemdb/gen/go/rq/v1"
"github.com/gernest/requiemdb/internal/arena"
"github.com/gernest/requiemdb/internal/bitmaps"
"github.com/gernest/requiemdb/internal/keys"
"github.com/gernest/requiemdb/internal/labels"
"github.com/gernest/requiemdb/internal/logger"
"github.com/gernest/requiemdb/internal/lsm"
"github.com/gernest/requiemdb/internal/retry"
"github.com/gernest/requiemdb/internal/seq"
"github.com/gernest/requiemdb/internal/transform"
)
type Storage struct {
db *badger.DB
dataCache *ristretto.Cache
bitmapCache *ristretto.Cache
tree *lsm.Tree
seq *seq.Seq
min, max atomic.Uint64
}
const (
DataCacheSize = 256 << 20
BitmapCacheSize = DataCacheSize * 2
)
func NewStore(db *badger.DB, seq *seq.Seq, tree *lsm.Tree) (*Storage, error) {
dataCache, err := ristretto.NewCache(&ristretto.Config{
NumCounters: 1e7,
MaxCost: DataCacheSize,
BufferItems: 64,
})
if err != nil {
return nil, err
}
bitmapCache, err := ristretto.NewCache(&ristretto.Config{
NumCounters: 1e7,
MaxCost: BitmapCacheSize,
BufferItems: 64,
OnExit: persistBitmaps(db),
})
if err != nil {
return nil, err
}
return &Storage{
db: db,
dataCache: dataCache,
bitmapCache: bitmapCache,
tree: tree,
seq: seq,
}, nil
}
// Saves evicted bitmaps to db
func persistBitmaps(db *badger.DB) func(a any) {
return func(a any) {
b := a.(*bitmaps.Bitmap)
defer b.Release()
ga := arena.New()
defer ga.Release()
_, err := b.WriteTo(ga.NewWriter())
if err != nil {
logger.Fail("BUG: failed serializing bitmap")
}
err = db.Update(func(txn *badger.Txn) error {
return txn.Set(b.Key(), ga.Bytes())
})
if err != nil {
logger.Fail("BUG: failed saving bitmap")
}
}
}
func (s *Storage) Close() error {
s.dataCache.Close()
s.bitmapCache.Close()
s.seq.Release()
return s.tree.Close()
}
func (s *Storage) Start(ctx context.Context) {
s.tree.Start(ctx)
}
// Save indexes and saves compressed data into badger key/value store. See
// transform package on which metadata is extracted from data for indexing.
//
// data is assigned a SampleID and two indexes are built for this SampleID
// lookup.
//
// # Metadata Index
//
// This tracks minTs,maxTs observed in data. For efficiency we use LSM tree
// containing arrow.Record of *v1.Meta. This index is kept in memory and
// persisted for durability but all computation are done in memory using arrow
// compute package.
//
// # Roaring Bitmap Index
//
// A label to bitmap of samples mapping. This is kept in bitmap cache and
// persisted on tha key value store upon eviction.
func (s *Storage) Save(data *v1.Data) error {
id := s.seq.SampleID()
save := func() error {
err := s.save(data, id)
if err != nil {
if !errors.Is(err, badger.ErrConflict) {
return backoff.Permanent(err)
}
// Retry only when we hit txn conflicts
return err
}
return nil
}
return retry.Do(save)
}
func (s *Storage) save(data *v1.Data, id uint64) error {
ctx := transform.NewContext()
defer ctx.Release()
ctx.Process(data)
meta := resourceFrom(data)
txnData := arena.New()
defer txnData.Release()
compressedData, err := txnData.Compress(data)
if err != nil {
return err
}
key := keys.New()
defer key.Release()
err = s.db.Update(func(txn *badger.Txn) error {
sampleKey := key.WithResource(meta).
WithID(id)
err = txn.Set(sampleKey.Encode(), compressedData)
if err != nil {
return err
}
err = ctx.Labels.Iter(func(lbl *labels.Label) error {
return s.saveLabel(txn, lbl.Encode(), id)
})
if err != nil {
return err
}
return nil
})
if err != nil {
return err
}
s.tree.Append(meta, id, ctx.MinTs, ctx.MaxTs)
minTs := s.min.Load()
if minTs == 0 {
minTs = ctx.MinTs
}
minTs = min(minTs, ctx.MinTs)
maxTs := max(s.max.Load(), ctx.MaxTs)
s.min.Store(minTs)
s.max.Store(maxTs)
return nil
}
func (s *Storage) MinTs() uint64 {
return s.min.Load()
}
func (s *Storage) MaxTs() uint64 {
return s.max.Load()
}
func resourceFrom(data *v1.Data) v1.RESOURCE {
switch data.Data.(type) {
case *v1.Data_Logs:
return v1.RESOURCE_LOGS
case *v1.Data_Traces:
return v1.RESOURCE_TRACES
default:
return v1.RESOURCE_METRICS
}
}
// Saves sampleID in a roaring bitmap for key. key is a serialized label
// generated by transform.Context on a sample.
func (s *Storage) saveLabel(txn *badger.Txn, key []byte, sampleID uint64) error {
hash := xxhash.Sum64(key)
var b *bitmaps.Bitmap
if r, ok := s.bitmapCache.Get(hash); ok {
b = r.(*bitmaps.Bitmap)
b.Lock()
defer b.Unlock()
b.Add(sampleID)
} else {
b = bitmaps.New().WithKey(key)
it, err := txn.Get(key)
if err != nil {
if !errors.Is(err, badger.ErrKeyNotFound) {
return err
}
} else {
err = it.Value(b.UnmarshalBinary)
if err != nil {
return err
}
}
b.Add(sampleID)
s.bitmapCache.Set(hash, b, b.Size())
}
return nil
}