Struct DB 

pub struct DB { /* private fields */ }

The main database handle for KotobaDB. This provides the user-facing API for database operations.

Implementations

impl DB

pub fn open_memory() -> Result<Self>

Opens a new database instance using an in-memory storage engine. This is useful for testing, prototyping, or temporary data.

pub async fn begin_transaction(&self) -> Result<u64>

Begins a new transaction

pub async fn commit_transaction(&mut self, txn_id: u64) -> Result<()>

Commits a transaction

pub async fn rollback_transaction(&mut self, txn_id: u64) -> Result<()>

Rolls back a transaction

pub async fn add_operation( &self, txn_id: u64, operation: Operation, ) -> Result<()>

Adds an operation to a transaction

pub async fn create_node( &mut self, properties: BTreeMap<String, Value>, ) -> Result<Cid>

Creates a new node in the database.

Arguments

• properties - A map of property names to values for this node

Returns

The CID of the created node block

pub async fn create_edge( &mut self, label: String, from_cid: Cid, to_cid: Cid, properties: BTreeMap<String, Value>, ) -> Result<Cid>

Creates a new edge in the database.

Arguments

• label - The label/type of the edge (e.g., “FRIENDS_WITH”, “WORKS_AT”)
• from_cid - CID of the source node
• to_cid - CID of the target node
• properties - A map of property names to values for this edge

Returns

The CID of the created edge block

pub async fn get_block(&self, cid: &Cid) -> Result<Option<Block>>

Retrieves a block by its CID.

pub async fn get_node(&self, cid: &Cid) -> Result<Option<NodeBlock>>

Retrieves a node by its CID.

pub async fn get_edge(&self, cid: &Cid) -> Result<Option<EdgeBlock>>

Retrieves an edge by its CID.

pub async fn find_nodes( &self, filters: &[(String, Value)], ) -> Result<Vec<(Cid, NodeBlock)>>

Finds nodes that match the given property filters

pub async fn find_edges( &self, label_filter: Option<&str>, from_filter: Option<Cid>, to_filter: Option<Cid>, property_filters: &[(String, Value)], ) -> Result<Vec<(Cid, EdgeBlock)>>

Finds edges that match the given criteria

pub async fn traverse( &self, start_cid: Cid, direction: TraversalDirection, max_depth: usize, edge_labels: Option<&[String]>, ) -> Result<HashMap<Cid, Vec<Cid>>>

Performs a basic graph traversal from a starting node