diff --git a/crates/db/src/tuplebox/base_relation.rs b/crates/db/src/tuplebox/base_relation.rs index 26019ae4..75d2635f 100644 --- a/crates/db/src/tuplebox/base_relation.rs +++ b/crates/db/src/tuplebox/base_relation.rs @@ -39,6 +39,7 @@ use crate::tuplebox::RelationId; // modified to support CoW/shared ownership of the tree nodes, like the im::HashMap does. // if we're going to support on-disk indexes, use a CoW B+Tree, which I have implemented elsewhere, // but will need to bring in here, optimize, and provide loving care to. +// TODO: support bitmap indexes #[derive(Clone)] pub struct BaseRelation { pub(crate) id: RelationId, diff --git a/crates/db/src/tuplebox/tuples/tuple_ptr.rs b/crates/db/src/tuplebox/tuples/tuple_ptr.rs index 8ab30055..fde7b487 100644 --- a/crates/db/src/tuplebox/tuples/tuple_ptr.rs +++ b/crates/db/src/tuplebox/tuples/tuple_ptr.rs @@ -23,6 +23,8 @@ use crate::tuplebox::tuples::{SlotBox, TupleId}; /// which allows the SlotBox to manage the lifetime of the tuple, swizzling it in and out of memory as needed. /// Adds a layer of indirection to each tuple access, but is better than passing around tuple ids + slotbox /// references. + +// TODO: rather than decoding a tuple out of a buffer in the slot, the slot should just hold the tuple structure pub struct TuplePtr { sb: Arc, id: TupleId,