Struct CombinedGraphBackend 

pub struct CombinedGraphBackend { /* private fields */ }

SQLite-authoritative backend mode.

In the current Phase 2 slice, this is an explicit composition point over the SQLite backend. It preserves today’s SQLite execution behavior while giving combined mode its own public type and future materialization seam.

Implementations

impl CombinedGraphBackend

pub fn in_memory() -> Result<Self, SqliteGraphError>

Create a new combined backend with an in-memory SQLite authority store.

pub fn in_memory_with_config( config: CombinedConfig, ) -> Result<Self, SqliteGraphError>

Create a new combined backend with an in-memory SQLite authority store and explicit combined-mode configuration.

pub fn from_sqlite_backend(sqlite: SqliteGraphBackend) -> Self

Create a combined backend from an existing SQLite backend.

pub fn from_sqlite_backend_with_config( sqlite: SqliteGraphBackend, config: CombinedConfig, ) -> Self

Create a combined backend from an existing SQLite backend and combined-mode configuration.

pub fn from_graph(graph: SqliteGraph) -> Self

Create a combined backend from an existing SqliteGraph.

pub fn from_graph_with_config( graph: SqliteGraph, config: CombinedConfig, ) -> Self

Create a combined backend from an existing SqliteGraph and combined-mode configuration.

pub fn sqlite_backend(&self) -> &SqliteGraphBackend

Access the authoritative SQLite backend used by combined mode.

pub fn graph(&self) -> &SqliteGraph

Access the authoritative SQLite graph used by combined mode.

pub fn publish_materialized_views(&self) -> Result<i64, SqliteGraphError>

Rebuild and publish combined-mode materialized traversal views from authoritative SQLite truth.

Returns the published materialized version, which matches the current authoritative SQLite version at publish time.

Trait Implementations

impl GraphBackend for CombinedGraphBackend

fn insert_node(&self, node: NodeSpec) -> Result<i64, SqliteGraphError>

fn insert_edge(&self, edge: EdgeSpec) -> Result<i64, SqliteGraphError>

fn update_node( &self, node_id: i64, node: NodeSpec, ) -> Result<i64, SqliteGraphError>

Update an existing node in place without allocating a new node ID

fn delete_entity(&self, id: i64) -> Result<(), SqliteGraphError>

Delete an entity (node) from the graph by ID

fn entity_ids(&self) -> Result<Vec<i64>, SqliteGraphError>

Get all entity IDs from the graph

fn get_node( &self, snapshot_id: SnapshotId, id: i64, ) -> Result<GraphEntity, SqliteGraphError>

fn neighbors( &self, snapshot_id: SnapshotId, node: i64, query: NeighborQuery, ) -> Result<Vec<i64>, SqliteGraphError>

fn bfs( &self, snapshot_id: SnapshotId, start: i64, depth: u32, ) -> Result<Vec<i64>, SqliteGraphError>

fn shortest_path( &self, snapshot_id: SnapshotId, start: i64, end: i64, ) -> Result<Option<Vec<i64>>, SqliteGraphError>

fn node_degree( &self, snapshot_id: SnapshotId, node: i64, ) -> Result<(usize, usize), SqliteGraphError>

fn k_hop( &self, snapshot_id: SnapshotId, start: i64, depth: u32, direction: BackendDirection, ) -> Result<Vec<i64>, SqliteGraphError>

fn k_hop_filtered( &self, snapshot_id: SnapshotId, start: i64, depth: u32, direction: BackendDirection, allowed_edge_types: &[&str], ) -> Result<Vec<i64>, SqliteGraphError>

fn bfs_filtered( &self, snapshot_id: SnapshotId, start: i64, depth: u32, direction: BackendDirection, allowed_edge_types: &[&str], ) -> Result<Vec<i64>, SqliteGraphError>

fn shortest_path_filtered( &self, snapshot_id: SnapshotId, start: i64, end: i64, allowed_edge_types: &[&str], ) -> Result<Option<Vec<i64>>, SqliteGraphError>

fn chain_query( &self, snapshot_id: SnapshotId, start: i64, chain: &[ChainStep], ) -> Result<Vec<i64>, SqliteGraphError>

fn pattern_search( &self, snapshot_id: SnapshotId, start: i64, pattern: &PatternQuery, ) -> Result<Vec<PatternMatch>, SqliteGraphError>

fn match_triples( &self, pattern: &PatternTriple, ) -> Result<Vec<TripleMatch>, SqliteGraphError>

Match triples based on a pattern triple

fn vector_search( &self, snapshot: SnapshotId, index_name: &str, vector: &[f32], k: usize, ) -> Result<Vec<(i64, f32)>, SqliteGraphError>

Search HNSW vector index for nearest neighbors

fn get_graph_ref(&self) -> Option<&SqliteGraph>

Get reference to underlying SqliteGraph (if available)

fn checkpoint(&self) -> Result<(), SqliteGraphError>

Trigger WAL checkpoint for backends that support write-ahead logging

fn flush(&self) -> Result<(), SqliteGraphError>

Force immediate flush of WAL buffer to disk

fn backup(&self, backup_dir: &Path) -> Result<BackupResult, SqliteGraphError>

Create a backup of the database

fn snapshot_export( &self, export_dir: &Path, ) -> Result<SnapshotMetadata, SqliteGraphError>

Export database snapshot to the specified directory

fn snapshot_import( &self, import_dir: &Path, ) -> Result<ImportMetadata, SqliteGraphError>

Import database snapshot from the specified directory

fn kv_get( &self, snapshot_id: SnapshotId, key: &[u8], ) -> Result<Option<KvValue>, SqliteGraphError>

Get a value from the KV store at the given snapshot

fn kv_set( &self, key: Vec<u8>, value: KvValue, ttl_seconds: Option<u64>, ) -> Result<(), SqliteGraphError>

Set a value in the KV store

fn kv_delete(&self, key: &[u8]) -> Result<(), SqliteGraphError>

Delete a value from the KV store

fn subscribe( &self, filter: SubscriptionFilter, ) -> Result<(u64, Receiver<PubSubEvent>), SqliteGraphError>

Subscribe to graph change events

fn unsubscribe(&self, subscriber_id: u64) -> Result<bool, SqliteGraphError>

Unsubscribe from events

fn kv_prefix_scan( &self, snapshot_id: SnapshotId, prefix: &[u8], ) -> Result<Vec<(Vec<u8>, KvValue)>, SqliteGraphError>

Scan all KV entries with a given prefix

fn query_nodes_by_kind( &self, snapshot_id: SnapshotId, kind: &str, ) -> Result<Vec<i64>, SqliteGraphError>

Query all nodes with a given kind

fn query_nodes_by_name_pattern( &self, snapshot_id: SnapshotId, pattern: &str, ) -> Result<Vec<i64>, SqliteGraphError>

Query nodes by name pattern using glob matching

fn insert_node_with_id( &self, node: NodeSpec, node_id: i64, ) -> Result<i64, SqliteGraphError>

Insert a node with a manually specified ID.

fn insert_nodes_bulk( &self, nodes: &[NodeSpec], ) -> Result<Vec<i64>, SqliteGraphError>

Insert many nodes atomically.

fn insert_edges_bulk( &self, edges: &[EdgeSpec], ) -> Result<Vec<i64>, SqliteGraphError>

Insert many edges atomically.

fn all_entity_ids(&self) -> Result<Vec<i64>, SqliteGraphError>

Alias for entity_ids() for backward compatibility with algorithms

fn fetch_outgoing(&self, node: i64) -> Result<Vec<i64>, SqliteGraphError>

Get outgoing neighbors for a node (convenience method)

fn fetch_incoming(&self, node: i64) -> Result<Vec<i64>, SqliteGraphError>

Get incoming neighbors for a node (convenience method)