Struct SqliteGraph 

pub struct SqliteGraph { /* private fields */ }

SQLite-backed GraphBackend over one mutex-guarded connection.

Opening applies the schema and runs any pending migrations, so a database created by an older llm-kernel is upgraded transparently on open.

Implementations

impl SqliteGraph

pub fn open(path: impl AsRef<Path>) -> Result<Self>

Open (or create) a graph database at path, applying schema + migrations.

pub fn open_in_memory() -> Result<Self>

Create an in-memory graph (useful for tests and ephemeral stores).

impl SqliteGraph

CJK-aware convenience methods (available with the graph-cjk feature).

pub fn search_nodes_cjk( &self, query: &str, limit: usize, ) -> Result<Vec<GraphNode>>

CJK (or mixed) search via contiguous substring matching.

Delegates to crate::graph::cjk::search_nodes_cjk; see its docs for the matching semantics.

pub fn segment_cjk(text: &str) -> String

Segment a string for CJK tokenization (exposed for callers that want to pre-process queries or inspect tokenization).

Trait Implementations

impl GraphBackend for SqliteGraph

fn upsert_node(&self, node: &GraphNode) -> Result<()>

Insert or replace a node.

fn read_node(&self, id: &str) -> Result<Option<GraphNode>>

Read a single node by ID (None if absent).

fn delete_node(&self, id: &str) -> Result<bool>

Delete a node by ID. Returns true if a row was removed.

fn search_nodes(&self, query: &str, limit: usize) -> Result<Vec<GraphNode>>

FTS5 full-text search, ranked by importance DESC.

fn query_nodes( &self, tag: Option<&str>, node_type: Option<&str>, project: Option<&str>, limit: usize, ) -> Result<Vec<GraphNode>>

Dynamic filter by tag / node_type / project.

fn smart_recall( &self, project: Option<&str>, hint: Option<&str>, limit: usize, ) -> Result<Vec<ScoredNode>>

Composite recall — rank nodes by recency, importance, access, FTS, and graph boost. The canonical high-level read path for “what’s relevant”.

fn related_nodes(&self, start_id: &str, depth: usize) -> Result<Vec<String>>

BFS-traverse up to depth hops from start_id, returning related node IDs (excluding the start).

fn append_edge(&self, edge: &GraphEdge) -> Result<()>

Append an edge (duplicates by edge ID are ignored).

fn edges_for_node(&self, node_id: &str) -> Result<Vec<GraphEdge>>

Read edges where the given node is source or target.

fn delete_edge(&self, id: &str) -> Result<bool>

Delete an edge by ID. Returns true if a row was removed.

fn remove_edges_for_node(&self, node_id: &str) -> Result<()>

Remove every edge connected to a node.

fn current_version(&self) -> Result<u32>

Recorded schema version for this backend.

fn migrate(&self) -> Result<u32>

Apply pending migrations up to the backend’s latest schema version. Returns the resulting version.