Crate kermit_ds 

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 traits, making them interchangeable in join algorithms.

Structs

ColumnTrie

A column-oriented trie that stores a relation as parallel arrays per level.

RelationHeader

Metadata for a relation: its name, attribute names, and arity.

TreeTrie

A pointer-based trie that stores a relation as a tree of TrieNodes.

Enums

IndexStructure

The available trie-based index structures for storing relations.

RelationError

Error type for relation file operations (CSV and Parquet).

Traits

HeapSize

Trait for calculating heap-allocated memory usage.

Projectable

A relation that can produce a new relation containing only the specified columns.

Relation

The Relation trait defines a relational data structure that can store and retrieve tuples of usize keys, and participate in join operations.

RelationFileExt

Extension trait for Relation to add file reading capabilities.