kermit-ds 0.1.0

Data structures used in Kermit
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

//! Data structures for Kermit's relational algebra engine.
//!
//! Provides two trie-based relation implementations:
//!
//! - [`TreeTrie`]: A pointer-based trie where each node owns its children.
//!   Simple and cache-friendly for small relations.
//! - [`ColumnTrie`]: A column-oriented (flattened) trie that stores each level
//!   in parallel `data`/`interval` arrays. More compact for large relations.
//!
//! Both implement the [`Relation`] and
//! [`TrieIterable`](kermit_iters::TrieIterable) traits, making them
//! interchangeable in join algorithms.

mod ds;
mod heap_size;
mod relation;
mod shared;

// Re-export IndexStructure for external crates (CLI) to reference directly
pub use {
    ds::{ColumnTrie, IndexStructure, TreeTrie},
    heap_size::HeapSize,
    relation::{Projectable, Relation, RelationError, RelationFileExt, RelationHeader},
};