nodedb-lite 0.1.0

Embedded edge client for NodeDB — offline vector search, graph traversal, and CRDT sync
Documentation
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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
// SPDX-License-Identifier: Apache-2.0

//! Conservative retained-index leases survive retraction and move with publication.

use crate::engine::fts::LiteFtsIndex;
use crate::error::LiteError;
use nodedb_fts::IndexScope;
use nodedb_mem::{EngineId, MemoryGovernor, ReservationToken, ScopedMemory};
use nodedb_types::{DatabaseId, Surrogate, TenantId};
use std::collections::HashMap;
use std::sync::Arc;

#[derive(Default)]
pub(super) struct RetainedIndex {
    chunks: Vec<ReservationToken>,
    dense_slots: usize,
    row_estimated_bytes: HashMap<u32, usize>,
}

fn memory(governor: Arc<MemoryGovernor>) -> ScopedMemory {
    ScopedMemory::new(
        governor,
        DatabaseId::new(0),
        TenantId::new(0),
        EngineId::Fts,
    )
}

fn overflow(key: &str) -> LiteError {
    LiteError::Backpressure {
        detail: format!(
            "retained full-text index '{key}' exceeds addressable memory. Reduce indexed fields or text"
        ),
    }
}

/// Bytes one token occurrence holds in index `key`: its scoped key and
/// posting, the normalized string, hash buckets, its position, and geometric
/// Vec capacity. Live writes and checkpoint restore both charge through it.
fn occurrence_cost(key_len: usize, term_len: usize) -> Option<usize> {
    let per_token = key_len.checked_add(5)?.checked_mul(2)?.checked_add(320)?;
    term_len.checked_mul(4)?.checked_add(per_token)
}

fn estimate_row(key: &str, tokens: &[String]) -> Result<usize, LiteError> {
    tokens.iter().try_fold(0usize, |bytes, token| {
        occurrence_cost(key.len(), token.len())
            .and_then(|cost| bytes.checked_add(cost))
            .ok_or_else(|| overflow(key))
    })
}

impl RetainedIndex {
    pub(super) fn reserve_base(
        &mut self,
        governor: Arc<MemoryGovernor>,
        key: &str,
    ) -> Result<(), LiteError> {
        let bytes = key
            .len()
            .checked_mul(4)
            .and_then(|bytes| bytes.checked_add(1024))
            .ok_or_else(|| overflow(key))?;
        self.chunks.push(memory(governor).reserve(bytes).map_err(|error| LiteError::Backpressure { detail: format!("retained full-text index '{key}': {error}. Increase the FTS budget or reduce indexed fields") })?);
        Ok(())
    }

    pub(super) fn reserve_write(
        &mut self,
        governor: Arc<MemoryGovernor>,
        key: &str,
        surrogate: Surrogate,
        tokens: &[String],
    ) -> Result<(), LiteError> {
        if tokens.is_empty() {
            return Ok(());
        }
        let slots = (surrogate.0 as usize)
            .checked_add(1)
            .ok_or_else(|| overflow(key))?;
        let dense = slots
            .saturating_sub(self.dense_slots)
            .checked_mul(16)
            .ok_or_else(|| overflow(key))?;
        let row = estimate_row(key, tokens)?;
        let previous = self
            .row_estimated_bytes
            .get(&surrogate.0)
            .copied()
            .unwrap_or(0);
        let row_metadata = if self.row_estimated_bytes.contains_key(&surrogate.0) {
            0
        } else {
            128
        };
        let bytes = row
            .saturating_sub(previous)
            .checked_add(dense)
            .and_then(|bytes| bytes.checked_add(row_metadata))
            .ok_or_else(|| overflow(key))?;
        if bytes == 0 {
            return Ok(());
        }
        let token = memory(governor).reserve(bytes).map_err(|error| LiteError::Backpressure { detail: format!("retained full-text index '{key}' needs {bytes} bytes: {error}. Increase the FTS budget or reduce indexed text") })?;
        self.chunks.push(token);
        self.dense_slots = self.dense_slots.max(slots);
        self.row_estimated_bytes
            .insert(surrogate.0, previous.max(row));
        Ok(())
    }

    pub(super) fn restored(governor: Arc<MemoryGovernor>, key: &str, index: &LiteFtsIndex) -> Self {
        let mut bytes = 1024usize.saturating_add(key.len().saturating_mul(4));
        let mut row_estimated_bytes: HashMap<u32, usize> = HashMap::new();
        let scope = IndexScope::document(key);
        for term in index.memtable().terms(0, 0, scope) {
            let cost = occurrence_cost(key.len(), term.len()).unwrap_or(usize::MAX);
            for posting in index.memtable().get_postings(0, 0, scope, &term) {
                let occurrences = if posting.positions.is_empty() {
                    posting.term_freq as usize
                } else {
                    posting.positions.len()
                };
                let row = row_estimated_bytes.entry(posting.doc_id.0).or_default();
                *row = row.saturating_add(cost.saturating_mul(occurrences));
            }
        }
        for row in row_estimated_bytes.values() {
            bytes = bytes.saturating_add(*row).saturating_add(128);
        }
        // Dense slots run to this index's highest surrogate, as `reserve_write`
        // grows them, not to the store-wide surrogate counter.
        let dense_slots = row_estimated_bytes
            .keys()
            .max()
            .map_or(0, |surrogate| *surrogate as usize + 1);
        bytes = bytes.saturating_add(dense_slots.saturating_mul(16));
        Self {
            chunks: vec![memory(governor).charge(bytes)],
            dense_slots,
            row_estimated_bytes,
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use nodedb_mem::{EngineLimits, GovernorConfig};

    #[test]
    fn dense_surrogate_growth_is_reserved_before_writes() {
        let governor = Arc::new(
            MemoryGovernor::new(GovernorConfig {
                global_ceiling: 1024 * 1024,
                engine_limits: EngineLimits::uniform(4096),
            })
            .unwrap(),
        );
        let mut lease = RetainedIndex::default();
        lease.reserve_base(Arc::clone(&governor), "docs").unwrap();
        lease
            .reserve_write(Arc::clone(&governor), "docs", Surrogate(1), &["x".into()])
            .unwrap();
        assert!(matches!(
            lease.reserve_write(
                Arc::clone(&governor),
                "docs",
                Surrogate(1000),
                &["x".into()]
            ),
            Err(LiteError::Backpressure { .. })
        ));
        let used = governor
            .snapshot()
            .into_iter()
            .find(|entry| entry.engine == EngineId::Fts)
            .unwrap()
            .allocated;
        lease
            .reserve_write(Arc::clone(&governor), "docs", Surrogate(1), &["x".into()])
            .unwrap();
        assert_eq!(
            governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated,
            used
        );
        drop(lease);
        assert_eq!(
            governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated,
            0
        );
    }
    #[test]
    fn anchored_term_migration_reuses_leases_and_admits_a_replacement() {
        use crate::engine::fts::manager::FtsCollectionManager;
        use nodedb_types::{Value, text_search::TextSearchParams};
        let governor = Arc::new(
            MemoryGovernor::new(GovernorConfig {
                global_ceiling: 64 * 1024 * 1024,
                engine_limits: EngineLimits::uniform(768 * 1024),
            })
            .unwrap(),
        );
        let mut manager = FtsCollectionManager::new(Arc::clone(&governor));
        for term in 0..12 {
            manager
                .index_document("docs", &format!("anchor{term}"), &format!("word{term:02}"))
                .unwrap();
        }
        let mut warm = None;
        for term in 0..12 {
            let text = format!("word{term:02}");
            for mover in 0..64 {
                manager
                    .index_document("docs", &format!("mover{mover}"), &text)
                    .unwrap();
            }
            let used = governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated;
            if let Some(warm) = warm {
                assert_eq!(used, warm);
            } else {
                warm = Some(used);
            }
        }
        for term in 0..12 {
            let hits = manager
                .search(
                    "docs",
                    "",
                    &format!("word{term:02}"),
                    100,
                    &TextSearchParams::default(),
                )
                .unwrap();
            assert!(hits.iter().any(|hit| hit.doc_id == format!("anchor{term}")));
        }
        let mut candidate = manager
            .begin_replacement("docs", manager.current_declaration_record("docs"))
            .unwrap();
        for term in 0..12 {
            let id = format!("anchor{term}");
            let surrogate = manager.reserve_surrogate("docs", &id).unwrap();
            candidate
                .index_document_fields(
                    &id,
                    surrogate,
                    &HashMap::from([("body".into(), Value::String(format!("word{term:02}")))]),
                )
                .unwrap();
        }
        for mover in 0..64 {
            let id = format!("mover{mover}");
            let surrogate = manager.reserve_surrogate("docs", &id).unwrap();
            candidate
                .index_document_fields(
                    &id,
                    surrogate,
                    &HashMap::from([("body".into(), Value::String("word11".into()))]),
                )
                .unwrap();
        }
        manager.publish_replacement(candidate);
        assert_eq!(
            manager
                .search("docs", "body", "word11", 100, &TextSearchParams::default())
                .unwrap()
                .len(),
            65
        );
    }
    #[test]
    fn restored_identical_rows_keep_credit_while_token_diversification_reserves_growth() {
        use crate::engine::fts::manager::resident_index;
        let governor = crate::engine::fts::manager::test_governor();
        let index = resident_index(Arc::clone(&governor));
        let tokens = index
            .analyze_for_collection(0, 0, "docs", "abcdef")
            .unwrap();
        index
            .index_analyzed_document(0, 0, "docs", Surrogate(1), &tokens)
            .unwrap();
        let mut lease = RetainedIndex::restored(Arc::clone(&governor), "docs", &index);
        let before = governor
            .snapshot()
            .into_iter()
            .find(|entry| entry.engine == EngineId::Fts)
            .unwrap()
            .allocated;
        lease
            .reserve_write(Arc::clone(&governor), "docs", Surrogate(1), &tokens)
            .unwrap();
        assert_eq!(
            governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated,
            before
        );
        let diverse = index
            .analyze_for_collection(0, 0, "docs", "ab cde")
            .unwrap();
        assert!(diverse.len() > tokens.len());
        lease
            .reserve_write(Arc::clone(&governor), "docs", Surrogate(1), &diverse)
            .unwrap();
        assert!(
            governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated
                > before
        );
    }

    #[test]
    fn whitespace_and_stopwords_charge_no_postings_from_raw_text_size() {
        use crate::engine::fts::manager::FtsCollectionManager;
        let governor = Arc::new(
            MemoryGovernor::new(GovernorConfig {
                global_ceiling: 1024 * 1024,
                engine_limits: EngineLimits::uniform(4096),
            })
            .unwrap(),
        );
        let mut manager = FtsCollectionManager::new(Arc::clone(&governor));
        manager
            .index_document("docs", "id", &" ".repeat(16384))
            .unwrap();
        let base = governor
            .snapshot()
            .into_iter()
            .find(|entry| entry.engine == EngineId::Fts)
            .unwrap()
            .allocated;
        manager
            .index_document("docs", "id", &"the and ".repeat(2048))
            .unwrap();
        assert_eq!(
            governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated,
            base
        );
        assert!(manager.indices["docs"].memtable().is_empty());
    }

    #[test]
    fn candidate_budget_refusal_preserves_prior_search_and_releases_private_credit() {
        use crate::engine::fts::manager::FtsCollectionManager;
        use nodedb_types::{Value, text_search::TextSearchParams};
        let governor = Arc::new(
            MemoryGovernor::new(GovernorConfig {
                global_ceiling: 1024 * 1024,
                engine_limits: EngineLimits::uniform(4096),
            })
            .unwrap(),
        );
        let mut manager = FtsCollectionManager::new(Arc::clone(&governor));
        manager.index_document("docs", "id", "alpha").unwrap();
        let prior = governor
            .snapshot()
            .into_iter()
            .find(|entry| entry.engine == EngineId::Fts)
            .unwrap()
            .allocated;
        let mut candidate = manager
            .begin_replacement("docs", manager.current_declaration_record("docs"))
            .unwrap();
        let surrogate = manager.reserve_surrogate("docs", "id").unwrap();
        assert!(matches!(
            candidate.index_document_fields(
                "id",
                surrogate,
                &HashMap::from([(
                    "body".into(),
                    Value::String("beta gamma delta epsilon zeta eta theta iota".into())
                )])
            ),
            Err(LiteError::Backpressure { .. })
        ));
        assert_eq!(
            manager
                .search("docs", "", "alpha", 10, &TextSearchParams::default())
                .unwrap()
                .len(),
            1
        );
        drop(candidate);
        assert_eq!(
            governor
                .snapshot()
                .into_iter()
                .find(|entry| entry.engine == EngineId::Fts)
                .unwrap()
                .allocated,
            prior
        );
    }
}