sombra 0.3.6

High-performance graph database with ACID transactions, single-file storage, and bindings for Rust, TypeScript, and Python
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
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
use crate::error::{GraphError, Result};
use crate::model::NodeId;
use crate::pager::{PageId, Pager};
use std::collections::{BTreeMap, BTreeSet, HashMap};
use tracing::{debug, info};

use super::graphdb::IndexableValue;

const PROPERTY_INDEX_MAGIC: &[u8; 4] = b"PIDX";
const PROPERTY_INDEX_VERSION: u16 = 1;

type PropertyIndexMap = HashMap<(String, String), BTreeMap<IndexableValue, BTreeSet<NodeId>>>;
type IndexEntry = BTreeMap<IndexableValue, BTreeSet<NodeId>>;

pub struct PropertyIndexSerializer<'a> {
    pager: &'a mut Pager,
}

impl<'a> PropertyIndexSerializer<'a> {
    pub fn new(pager: &'a mut Pager) -> Self {
        Self { pager }
    }

    pub fn serialize_indexes(
        &mut self,
        indexes: &PropertyIndexMap,
    ) -> Result<(PageId, u32, Vec<PageId>)> {
        if indexes.is_empty() {
            return Ok((0, 0, Vec::new()));
        }

        let mut serialized_data = Vec::new();

        serialized_data.extend_from_slice(PROPERTY_INDEX_MAGIC);
        serialized_data.extend_from_slice(&PROPERTY_INDEX_VERSION.to_le_bytes());

        let count = indexes.len() as u32;
        serialized_data.extend_from_slice(&count.to_le_bytes());

        for ((label, property_key), index) in indexes {
            self.serialize_single_index(&mut serialized_data, label, property_key, index)?;
        }

        let (root_page, written_pages) = self.write_serialized_data(&serialized_data)?;

        info!(
            count = indexes.len(),
            root_page,
            size_bytes = serialized_data.len(),
            "Serialized property indexes"
        );

        Ok((root_page, count, written_pages))
    }

    pub fn collect_old_pages(&mut self, root_page: PageId) -> Result<Vec<PageId>> {
        let mut pages = Vec::new();
        let mut current_page = root_page;

        while current_page != 0 {
            pages.push(current_page);

            let next_page = self.pager.with_page(current_page, |page_data| {
                let next =
                    u32::from_le_bytes([page_data[4], page_data[5], page_data[6], page_data[7]]);
                Ok(next)
            })?;

            current_page = next_page;
        }

        Ok(pages)
    }

    fn serialize_single_index(
        &self,
        data: &mut Vec<u8>,
        label: &str,
        property_key: &str,
        index: &IndexEntry,
    ) -> Result<()> {
        let label_bytes = label.as_bytes();
        data.extend_from_slice(&(label_bytes.len() as u32).to_le_bytes());
        data.extend_from_slice(label_bytes);

        let property_key_bytes = property_key.as_bytes();
        data.extend_from_slice(&(property_key_bytes.len() as u32).to_le_bytes());
        data.extend_from_slice(property_key_bytes);

        let entry_count = index.len() as u32;
        data.extend_from_slice(&entry_count.to_le_bytes());

        for (indexable_value, node_ids) in index {
            self.serialize_indexable_value(data, indexable_value)?;

            let node_count = node_ids.len() as u32;
            data.extend_from_slice(&node_count.to_le_bytes());

            for node_id in node_ids {
                data.extend_from_slice(&node_id.to_le_bytes());
            }
        }

        Ok(())
    }

    fn serialize_indexable_value(&self, data: &mut Vec<u8>, value: &IndexableValue) -> Result<()> {
        match value {
            IndexableValue::Bool(b) => {
                data.push(1);
                data.push(if *b { 1 } else { 0 });
            }
            IndexableValue::Int(i) => {
                data.push(2);
                data.extend_from_slice(&i.to_le_bytes());
            }
            IndexableValue::String(s) => {
                data.push(3);
                let s_bytes = s.as_bytes();
                data.extend_from_slice(&(s_bytes.len() as u32).to_le_bytes());
                data.extend_from_slice(s_bytes);
            }
        }
        Ok(())
    }

    fn write_serialized_data(&mut self, data: &[u8]) -> Result<(PageId, Vec<PageId>)> {
        let page_size = self.pager.page_size();
        // Page layout: [4 bytes chunk_len][4 bytes next_page][data]
        // The pager automatically reserves last 4 bytes for checksum
        // Usable space = (page_size - 4 checksum) - 8 (header) = page_size - 12
        let chunk_size = page_size - 12;
        let pages_needed = data.chunks(chunk_size).count();

        if pages_needed == 0 {
            return Err(GraphError::Corruption(
                "no pages needed for property indexes".into(),
            ));
        }

        let mut pages = Vec::new();
        for _i in 0..pages_needed {
            let page_id = self.pager.allocate_page()?;
            pages.push(page_id);
        }

        for (i, chunk) in data.chunks(chunk_size).enumerate() {
            let page_id = pages[i];
            let next_page = if i + 1 < pages.len() { pages[i + 1] } else { 0 };

            let chunk_len = chunk.len() as u32;
            let page = self.pager.fetch_page(page_id)?;
            page.data[0..4].copy_from_slice(&chunk_len.to_le_bytes());
            page.data[4..8].copy_from_slice(&next_page.to_le_bytes());
            page.data[8..8 + chunk.len()].copy_from_slice(chunk);
            page.dirty = true;
        }

        Ok((pages[0], pages))
    }

    pub fn deserialize_indexes(&mut self, root_page: PageId) -> Result<PropertyIndexMap> {
        if root_page == 0 {
            return Ok(HashMap::new());
        }

        let serialized_data = self.read_serialized_data(root_page)?;

        if serialized_data.len() < 10 {
            return Err(GraphError::Corruption(
                "property index data too short".into(),
            ));
        }

        if &serialized_data[0..4] != PROPERTY_INDEX_MAGIC {
            return Err(GraphError::Corruption(
                "invalid property index magic".into(),
            ));
        }

        let version = u16::from_le_bytes([serialized_data[4], serialized_data[5]]);
        if version != PROPERTY_INDEX_VERSION {
            return Err(GraphError::Corruption(format!(
                "unsupported property index version {version}"
            )));
        }

        let count = u32::from_le_bytes([
            serialized_data[6],
            serialized_data[7],
            serialized_data[8],
            serialized_data[9],
        ]);

        let mut indexes = HashMap::new();
        let mut offset = 10;

        for _i in 0..count {
            let (key, index, new_offset) =
                self.deserialize_single_index(&serialized_data, offset)?;
            indexes.insert(key, index);
            offset = new_offset;
        }

        info!(count = indexes.len(), "Deserialized property indexes");

        Ok(indexes)
    }

    fn deserialize_single_index(
        &self,
        data: &[u8],
        mut offset: usize,
    ) -> Result<((String, String), IndexEntry, usize)> {
        if offset + 4 > data.len() {
            return Err(GraphError::Corruption(
                "truncated property index label".into(),
            ));
        }

        let label_len = u32::from_le_bytes([
            data[offset],
            data[offset + 1],
            data[offset + 2],
            data[offset + 3],
        ]) as usize;
        offset += 4;

        if offset + label_len > data.len() {
            return Err(GraphError::Corruption(
                "truncated property index label data".into(),
            ));
        }

        let label = String::from_utf8(data[offset..offset + label_len].to_vec())
            .map_err(|_| GraphError::Corruption("invalid UTF-8 in label".into()))?;
        offset += label_len;

        if offset + 4 > data.len() {
            return Err(GraphError::Corruption("truncated property key".into()));
        }

        let property_key_len = u32::from_le_bytes([
            data[offset],
            data[offset + 1],
            data[offset + 2],
            data[offset + 3],
        ]) as usize;
        offset += 4;

        if offset + property_key_len > data.len() {
            return Err(GraphError::Corruption("truncated property key data".into()));
        }

        let property_key = String::from_utf8(data[offset..offset + property_key_len].to_vec())
            .map_err(|_| GraphError::Corruption("invalid UTF-8 in property key".into()))?;
        offset += property_key_len;

        if offset + 4 > data.len() {
            return Err(GraphError::Corruption("truncated entry count".into()));
        }

        let entry_count = u32::from_le_bytes([
            data[offset],
            data[offset + 1],
            data[offset + 2],
            data[offset + 3],
        ]);
        offset += 4;

        let mut index = BTreeMap::new();

        for _entry_idx in 0..entry_count {
            let (indexable_value, new_offset) = self.deserialize_indexable_value(data, offset)?;
            offset = new_offset;

            if offset + 4 > data.len() {
                return Err(GraphError::Corruption("truncated node count".into()));
            }

            let node_count = u32::from_le_bytes([
                data[offset],
                data[offset + 1],
                data[offset + 2],
                data[offset + 3],
            ]);
            offset += 4;

            let mut node_ids = BTreeSet::new();
            for _ in 0..node_count {
                if offset + 8 > data.len() {
                    return Err(GraphError::Corruption("truncated node id".into()));
                }

                let node_id = u64::from_le_bytes([
                    data[offset],
                    data[offset + 1],
                    data[offset + 2],
                    data[offset + 3],
                    data[offset + 4],
                    data[offset + 5],
                    data[offset + 6],
                    data[offset + 7],
                ]);
                offset += 8;
                node_ids.insert(node_id);
            }

            index.insert(indexable_value, node_ids);
        }

        Ok(((label, property_key), index, offset))
    }

    fn deserialize_indexable_value(
        &self,
        data: &[u8],
        mut offset: usize,
    ) -> Result<(IndexableValue, usize)> {
        if offset >= data.len() {
            return Err(GraphError::Corruption(
                "truncated indexable value type".into(),
            ));
        }

        let value_type = data[offset];
        offset += 1;

        match value_type {
            1 => {
                if offset >= data.len() {
                    return Err(GraphError::Corruption("truncated bool value".into()));
                }
                let b = data[offset] != 0;
                offset += 1;
                Ok((IndexableValue::Bool(b), offset))
            }
            2 => {
                if offset + 8 > data.len() {
                    return Err(GraphError::Corruption("truncated int value".into()));
                }
                let i = i64::from_le_bytes([
                    data[offset],
                    data[offset + 1],
                    data[offset + 2],
                    data[offset + 3],
                    data[offset + 4],
                    data[offset + 5],
                    data[offset + 6],
                    data[offset + 7],
                ]);
                offset += 8;
                Ok((IndexableValue::Int(i), offset))
            }
            3 => {
                if offset + 4 > data.len() {
                    return Err(GraphError::Corruption("truncated string length".into()));
                }
                let str_len = u32::from_le_bytes([
                    data[offset],
                    data[offset + 1],
                    data[offset + 2],
                    data[offset + 3],
                ]) as usize;
                offset += 4;

                if offset + str_len > data.len() {
                    return Err(GraphError::Corruption("truncated string data".into()));
                }

                let s = String::from_utf8(data[offset..offset + str_len].to_vec())
                    .map_err(|_| GraphError::Corruption("invalid UTF-8 in string value".into()))?;
                offset += str_len;
                Ok((IndexableValue::String(s), offset))
            }
            _ => Err(GraphError::Corruption(format!(
                "invalid indexable value type {value_type}"
            ))),
        }
    }

    fn read_serialized_data(&mut self, root_page: PageId) -> Result<Vec<u8>> {
        let page_size = self.pager.page_size();
        // Page layout: [4 bytes chunk_len][4 bytes next_page][data]
        // The pager automatically reserves last 4 bytes for checksum
        // Max chunk size = (page_size - 4 checksum) - 8 (header) = page_size - 12
        let max_chunk_size = page_size - 12;
        let mut result = Vec::new();
        let mut current_page = root_page;

        let mut page_count = 0;

        loop {
            let mut chunk_len = 0u32;
            let mut next_page = 0u32;
            let mut chunk_data = Vec::new();

            self.pager.with_page(current_page, |page_data| {
                chunk_len =
                    u32::from_le_bytes([page_data[0], page_data[1], page_data[2], page_data[3]]);

                if chunk_len as usize > max_chunk_size {
                    return Err(GraphError::Corruption(
                        "invalid chunk length in property index page".into(),
                    ));
                }

                chunk_data.extend_from_slice(&page_data[8..8 + chunk_len as usize]);

                next_page =
                    u32::from_le_bytes([page_data[4], page_data[5], page_data[6], page_data[7]]);

                Ok(())
            })?;

            page_count += 1;

            result.extend_from_slice(&chunk_data);

            if next_page == 0 {
                break;
            }

            current_page = next_page;
        }

        debug!(
            pages_read = page_count,
            total_bytes = result.len(),
            "Read property index data"
        );

        Ok(result)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::pager::Pager;
    use tempfile::NamedTempFile;

    fn create_pager_with_reserved_header() -> (NamedTempFile, Pager) {
        let tmp = NamedTempFile::new().expect("temp file");
        let mut pager = Pager::open(tmp.path()).expect("open pager");
        let header_page = pager.allocate_page().expect("allocate header page");
        assert_eq!(
            header_page, 0,
            "First page should be 0 (reserved for header)"
        );
        (tmp, pager)
    }

    #[test]
    fn test_empty_index_serialization() {
        let tmp = NamedTempFile::new().expect("temp file");
        let mut pager = Pager::open(tmp.path()).expect("open pager");
        let mut serializer = PropertyIndexSerializer::new(&mut pager);

        let indexes = PropertyIndexMap::new();
        let (root_page, count, _pages) = serializer.serialize_indexes(&indexes).expect("serialize");

        assert_eq!(root_page, 0);
        assert_eq!(count, 0);
    }

    #[test]
    fn test_single_index_round_trip() {
        let (_tmp, mut pager) = create_pager_with_reserved_header();

        let root_page = {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let mut indexes = PropertyIndexMap::new();
            let mut index = BTreeMap::new();

            let mut node_set = BTreeSet::new();
            node_set.insert(1);
            node_set.insert(2);
            node_set.insert(3);
            index.insert(IndexableValue::Int(42), node_set);

            let mut node_set2 = BTreeSet::new();
            node_set2.insert(4);
            node_set2.insert(5);
            index.insert(IndexableValue::String("test".to_string()), node_set2);

            indexes.insert(("User".to_string(), "age".to_string()), index);

            let (root_page, count, _pages) =
                serializer.serialize_indexes(&indexes).expect("serialize");
            assert_eq!(count, 1);
            root_page
        };

        {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let deserialized = serializer
                .deserialize_indexes(root_page)
                .expect("deserialize");

            assert_eq!(deserialized.len(), 1);

            let index = deserialized
                .get(&("User".to_string(), "age".to_string()))
                .expect("index exists");

            assert_eq!(index.len(), 2);

            let nodes = index.get(&IndexableValue::Int(42)).expect("int value");
            assert_eq!(nodes.len(), 3);
            assert!(nodes.contains(&1));
            assert!(nodes.contains(&2));
            assert!(nodes.contains(&3));

            let nodes2 = index
                .get(&IndexableValue::String("test".to_string()))
                .expect("string value");
            assert_eq!(nodes2.len(), 2);
            assert!(nodes2.contains(&4));
            assert!(nodes2.contains(&5));
        }
    }

    #[test]
    fn test_multiple_indexes_round_trip() {
        let (_tmp, mut pager) = create_pager_with_reserved_header();

        let root_page = {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let mut indexes = PropertyIndexMap::new();

            let mut index1 = BTreeMap::new();
            let mut node_set1 = BTreeSet::new();
            node_set1.insert(1);
            node_set1.insert(2);
            index1.insert(IndexableValue::Int(30), node_set1);
            indexes.insert(("User".to_string(), "age".to_string()), index1);

            let mut index2 = BTreeMap::new();
            let mut node_set2 = BTreeSet::new();
            node_set2.insert(1);
            index2.insert(IndexableValue::String("John".to_string()), node_set2);
            indexes.insert(("User".to_string(), "name".to_string()), index2);

            let mut index3 = BTreeMap::new();
            let mut node_set3 = BTreeSet::new();
            node_set3.insert(3);
            index3.insert(IndexableValue::Bool(true), node_set3);
            indexes.insert(("Post".to_string(), "published".to_string()), index3);

            let (root_page, count, _pages) =
                serializer.serialize_indexes(&indexes).expect("serialize");
            assert_eq!(count, 3);
            root_page
        };

        {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let deserialized = serializer
                .deserialize_indexes(root_page)
                .expect("deserialize");

            assert_eq!(deserialized.len(), 3);
            assert!(deserialized.contains_key(&("User".to_string(), "age".to_string())));
            assert!(deserialized.contains_key(&("User".to_string(), "name".to_string())));
            assert!(deserialized.contains_key(&("Post".to_string(), "published".to_string())));
        }
    }

    #[test]
    fn test_large_index_round_trip() {
        let (_tmp, mut pager) = create_pager_with_reserved_header();

        let root_page = {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let mut indexes = PropertyIndexMap::new();
            let mut index = BTreeMap::new();

            for i in 0..1000 {
                let mut node_set = BTreeSet::new();
                node_set.insert(i);
                index.insert(IndexableValue::Int(i as i64), node_set);
            }

            indexes.insert(("User".to_string(), "id".to_string()), index);

            let (root_page, count, _pages) =
                serializer.serialize_indexes(&indexes).expect("serialize");
            assert_eq!(count, 1);
            root_page
        };

        {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let deserialized = serializer
                .deserialize_indexes(root_page)
                .expect("deserialize");

            let index = deserialized
                .get(&("User".to_string(), "id".to_string()))
                .expect("index exists");
            assert_eq!(index.len(), 1000);

            for i in 0..1000 {
                let nodes = index
                    .get(&IndexableValue::Int(i as i64))
                    .unwrap_or_else(|| panic!("value {} exists", i));
                assert_eq!(nodes.len(), 1);
                assert!(nodes.contains(&i));
            }
        }
    }

    #[test]
    fn test_all_value_types() {
        let (_tmp, mut pager) = create_pager_with_reserved_header();

        let root_page = {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let mut indexes = PropertyIndexMap::new();
            let mut index = BTreeMap::new();

            let mut bool_set = BTreeSet::new();
            bool_set.insert(1);
            index.insert(IndexableValue::Bool(true), bool_set.clone());
            index.insert(IndexableValue::Bool(false), bool_set.clone());

            let mut int_set = BTreeSet::new();
            int_set.insert(2);
            index.insert(IndexableValue::Int(0), int_set.clone());
            index.insert(IndexableValue::Int(-999), int_set.clone());
            index.insert(IndexableValue::Int(999), int_set.clone());

            let mut str_set = BTreeSet::new();
            str_set.insert(3);
            index.insert(IndexableValue::String("".to_string()), str_set.clone());
            index.insert(IndexableValue::String("short".to_string()), str_set.clone());
            index.insert(
                IndexableValue::String(
                    "a very long string with lots of characters to test serialization".to_string(),
                ),
                str_set.clone(),
            );

            indexes.insert(("Test".to_string(), "prop".to_string()), index);

            let (root_page, _, _pages) = serializer.serialize_indexes(&indexes).expect("serialize");
            root_page
        };

        {
            let mut serializer = PropertyIndexSerializer::new(&mut pager);
            let deserialized = serializer
                .deserialize_indexes(root_page)
                .expect("deserialize");

            let index = deserialized
                .get(&("Test".to_string(), "prop".to_string()))
                .expect("index exists");

            assert!(index.contains_key(&IndexableValue::Bool(true)));
            assert!(index.contains_key(&IndexableValue::Bool(false)));
            assert!(index.contains_key(&IndexableValue::Int(0)));
            assert!(index.contains_key(&IndexableValue::Int(-999)));
            assert!(index.contains_key(&IndexableValue::Int(999)));
            assert!(index.contains_key(&IndexableValue::String("".to_string())));
            assert!(index.contains_key(&IndexableValue::String("short".to_string())));
            assert!(index.contains_key(&IndexableValue::String(
                "a very long string with lots of characters to test serialization".to_string()
            )));
        }
    }

    #[test]
    fn test_deserialize_empty_returns_empty() {
        let tmp = NamedTempFile::new().expect("temp file");
        let mut pager = Pager::open(tmp.path()).expect("open pager");
        let mut serializer = PropertyIndexSerializer::new(&mut pager);

        let deserialized = serializer.deserialize_indexes(0).expect("deserialize");
        assert_eq!(deserialized.len(), 0);
    }
}