Struct SqliteGraphStore 

pub struct SqliteGraphStore { /* private fields */ }

SQLite implementation of GraphStore

Integrates with existing openfang-memory schema by adding two tables:

• ainl_graph_nodes: stores node payloads
• ainl_graph_edges: stores graph edges

Implementations

impl SqliteGraphStore

pub fn ensure_schema(conn: &Connection) -> Result<(), Error>

Ensure the AINL graph schema exists in the database

pub fn open(path: &Path) -> Result<Self, String>

Open/create a graph store at the given path

pub fn from_connection(conn: Connection) -> Result<Self, String>

Create from an existing connection (for integration with openfang-memory pool)

pub fn insert_graph_edge( &self, from_id: Uuid, to_id: Uuid, label: &str, ) -> Result<(), String>

Insert a directed edge between two node IDs (separate from per-node edge payloads).

pub fn query_nodes_by_type_since( &self, node_type: &str, since_timestamp: i64, limit: usize, ) -> Result<Vec<AinlMemoryNode>, String>

Nodes of a given node_type with timestamp >= since_timestamp, most recent first.

Trait Implementations

impl GraphStore for SqliteGraphStore

fn write_node(&self, node: &AinlMemoryNode) -> Result<(), String>

Persists the full node JSON under id via INSERT OR REPLACE (upsert). Backfill pattern: read_node → patch fields (e.g. episodic signals) → write_node, preserving loaded edges.

fn read_node(&self, id: Uuid) -> Result<Option<AinlMemoryNode>, String>

Read a node by ID

fn query_episodes_since( &self, since_timestamp: i64, limit: usize, ) -> Result<Vec<AinlMemoryNode>, String>

Query episodes since a given timestamp

fn find_by_type(&self, type_name: &str) -> Result<Vec<AinlMemoryNode>, String>

Find nodes by type

fn walk_edges( &self, from_id: Uuid, label: &str, ) -> Result<Vec<AinlMemoryNode>, String>

Walk edges from a node with a given label