Enum GraphOp 

pub enum GraphOp {
    EdgePut {
        collection: String,
        src_id: String,
        label: String,
        dst_id: String,
        properties: Vec<u8>,
        src_surrogate: Surrogate,
        dst_surrogate: Surrogate,
    },
    EdgePutBatch {
        edges: Vec<BatchEdge>,
    },
    EdgeDelete {
        collection: String,
        src_id: String,
        label: String,
        dst_id: String,
    },
    EdgeDeleteBatch {
        edges: Vec<BatchEdge>,
    },
    Hop {
        start_nodes: Vec<String>,
        edge_label: Option<String>,
        direction: Direction,
        depth: usize,
        options: GraphTraversalOptions,
        rls_filters: Vec<u8>,
        frontier_bitmap: Option<SurrogateBitmap>,
    },
    Neighbors {
        node_id: String,
        edge_label: Option<String>,
        direction: Direction,
        rls_filters: Vec<u8>,
    },
    NeighborsMulti {
        node_ids: Vec<String>,
        edge_label: Option<String>,
        direction: Direction,
        max_results: u32,
        rls_filters: Vec<u8>,
    },
    Path {
        src: String,
        dst: String,
        edge_label: Option<String>,
        max_depth: usize,
        options: GraphTraversalOptions,
        rls_filters: Vec<u8>,
        frontier_bitmap: Option<SurrogateBitmap>,
    },
    Subgraph {
        start_nodes: Vec<String>,
        edge_label: Option<String>,
        depth: usize,
        options: GraphTraversalOptions,
        rls_filters: Vec<u8>,
    },
    RagFusion {

        collection: String,
        query_vector: Vec<f32>,
        vector_top_k: usize,
        edge_label: Option<String>,
        direction: Direction,
        expansion_depth: usize,
        final_top_k: usize,
        rrf_k: (f64, f64),
        rrf_k_triple: Option<(f64, f64, f64)>,
        vector_field: String,
        options: GraphTraversalOptions,
        bm25_query: Option<String>,
        bm25_field: Option<String>,
    
},
    Algo {
        algorithm: GraphAlgorithm,
        params: AlgoParams,
    },
    Match {
        query: Vec<u8>,
        frontier_bitmap: Option<SurrogateBitmap>,
    },
    SetNodeLabels {
        node_id: String,
        labels: Vec<String>,
    },
    RemoveNodeLabels {
        node_id: String,
        labels: Vec<String>,
    },
    TemporalNeighbors {
        collection: String,
        node_id: String,
        edge_label: Option<String>,
        direction: Direction,
        system_as_of_ms: Option<i64>,
        valid_at_ms: Option<i64>,
        rls_filters: Vec<u8>,
    },
    TemporalAlgorithm {
        algorithm: GraphAlgorithm,
        params: AlgoParams,
        system_as_of_ms: Option<i64>,
    },
    Stats {
        collection: Option<String>,
        as_of: Option<i64>,
    },
}

Graph engine physical operations.

Variants

EdgePut

Insert a graph edge with properties.

src_surrogate / dst_surrogate carry the global row identity for the two endpoints, resolved at construction time. The string src_id / dst_id remain user-visible identifiers (used by the CSR partition for label interning and by the edge store for keying), while the surrogates are the cross-engine join currency.

Fields

collection: String

src_id: String

label: String

dst_id: String

properties: Vec<u8>

src_surrogate: Surrogate

dst_surrogate: Surrogate

EdgePutBatch

Batched edge insert: many (collection, src, label, dst) tuples. Every edge in the batch must target the same collection — the batch is a unit of work, not a cross-collection scatter.

Fields

edges: Vec<BatchEdge>

EdgeDelete

Delete a graph edge.

Fields

collection: String

src_id: String

label: String

dst_id: String

EdgeDeleteBatch

Batched edge delete: used to revert a partial EdgePutBatch on failure so the DDL leaves no stranded edges.

Fields

edges: Vec<BatchEdge>

Hop

Graph hop traversal: BFS from start nodes via label, bounded by depth.

Fields

start_nodes: Vec<String>

edge_label: Option<String>

direction: Direction

depth: usize

options: GraphTraversalOptions

rls_filters: Vec<u8>

RLS filters applied to traversed nodes before returning.

frontier_bitmap: Option<SurrogateBitmap>

Optional surrogate prefilter restricting which frontier nodes are eligible as traversal targets. None = no restriction.

Neighbors

Immediate 1-hop neighbors lookup.

Fields

node_id: String

edge_label: Option<String>

direction: Direction

rls_filters: Vec<u8>

RLS filters applied to neighbor nodes before returning.

NeighborsMulti

Batched 1-hop neighbors lookup: one RPC per hop of a BFS frontier instead of one RPC per frontier node. Returns [{ src, label, node }, ...] so the caller can attribute each neighbor to its origin (needed for shortest-path parent pointers).

max_results is the per-RPC cap: the Data Plane handler stops emitting entries once the batch reaches this size so a single wide hop cannot allocate past the caller’s budget. 0 means unbounded (use with care).

Fields

node_ids: Vec<String>

edge_label: Option<String>

direction: Direction

max_results: u32

rls_filters: Vec<u8>

RLS filters applied to neighbor nodes before returning.

Path

Shortest path between two nodes.

Fields

src: String

dst: String

edge_label: Option<String>

max_depth: usize

options: GraphTraversalOptions

rls_filters: Vec<u8>

RLS filters applied to path nodes before returning.

frontier_bitmap: Option<SurrogateBitmap>

Optional surrogate prefilter restricting which nodes may appear on the path. None = no restriction.

Subgraph

Materialize a subgraph as edge tuples.

Fields

start_nodes: Vec<String>

edge_label: Option<String>

depth: usize

options: GraphTraversalOptions

rls_filters: Vec<u8>

RLS filters applied to subgraph nodes/edges before returning.

RagFusion

GraphRAG fusion: vector search → graph expansion → RRF ranking.

Two-source form: vector + graph (backwards-compatible; bm25_query is None). Three-source form: vector + BM25 text + graph; activated when bm25_query is set.

Fields

collection: String

query_vector: Vec<f32>

vector_top_k: usize

edge_label: Option<String>

direction: Direction

expansion_depth: usize

final_top_k: usize

rrf_k: (f64, f64)

Two-source RRF k constants: (vector_k, graph_k). Used when bm25_query is absent (backwards-compatible two-source form).

rrf_k_triple: Option<(f64, f64, f64)>

Three-source RRF k constants: (vector_k, text_k, graph_k). Set when the FUSION DSL carries a BM25 '...' ON '...' clause.

vector_field: String

Vector index field name. Empty string selects the raw (field-less) index created via VectorOp::Insert; a non-empty value selects the field-backed index created when documents are inserted with an embedded vector column (e.g. INSERT INTO col (id, embedding) VALUES …).

options: GraphTraversalOptions

bm25_query: Option<String>

BM25 query string for the text leg of three-source fusion. None = two-source.

bm25_field: Option<String>

Document field on which BM25 scoring is applied. Required when bm25_query is set.

Algo

Graph algorithm execution (PageRank, WCC, SSSP, etc.).

Fields

algorithm: GraphAlgorithm

params: AlgoParams

Match

Graph pattern matching (MATCH clause execution).

Fields

query: Vec<u8>

Serialized MatchQuery (MessagePack).

frontier_bitmap: Option<SurrogateBitmap>

Optional surrogate prefilter restricting which nodes are eligible as pattern anchors. None = no restriction.

SetNodeLabels

Set node labels (bitset-based, up to 64 distinct labels).

Fields

node_id: String

labels: Vec<String>

RemoveNodeLabels

Remove node labels.

Fields

node_id: String

labels: Vec<String>

TemporalNeighbors

Bitemporal 1-hop neighbors lookup.

Resolves edges whose latest version with system_from <= system_as_of_ms (converted to HLC ordinal) is not a sentinel, optionally also filtering by valid_from_ms <= valid_at_ms < valid_until_ms. The handler calls ceiling_resolve_edge per candidate base edge.

Fields

collection: String

Edge store is collection-scoped; current-state Neighbors reads the tenant-wide CSR, but the versioned key layout is {collection}\x00..., so the bitemporal path must name the collection explicitly.

node_id: String

edge_label: Option<String>

direction: Direction

system_as_of_ms: Option<i64>

System-time cutoff in ms. None falls back to current-state semantics identical to Neighbors.

valid_at_ms: Option<i64>

Optional valid-time point. Skipped when None.

rls_filters: Vec<u8>

TemporalAlgorithm

Bitemporal graph algorithm execution.

Identical to Algo but builds its CSR snapshot via CsrSnapshot::from_edge_store_as_of at the given system-time cutoff before running the algorithm.

Fields

algorithm: GraphAlgorithm

params: AlgoParams

system_as_of_ms: Option<i64>

System-time cutoff in ms. None means current state (equivalent to plain Algo).

Stats

Read persistent graph-stats counters from the edge store.

collection = Some returns stats for one (tenant, collection) pair. collection = None returns stats for every collection that has edges (or had any, per cold-start rebuild) for this tenant.

as_of = None is the O(1) live-snapshot path (reads the cached summary row). as_of = Some(ms) falls back to a historical scan.

Fields

collection: Option<String>

as_of: Option<i64>

Trait Implementations

impl Clone for GraphOp

fn clone(&self) -> GraphOp

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphOp

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphOp

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'__msgpack_de> FromMessagePack<'__msgpack_de> for GraphOp

fn read<R: Read<'__msgpack_de>>(reader: &mut R) -> Result<Self, Error>

where Self: Sized,

Reads the MessagePack representation of this value from the provided reader.

impl PartialEq for GraphOp

fn eq(&self, other: &GraphOp) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphOp

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphOp

impl ToMessagePack for GraphOp

fn write<W: Write>(&self, writer: &mut W) -> Result<(), Error>

Writes the MessagePack representation of this value into the provided writer.