Struct SubqueryGraph 

pub struct SubqueryGraph {
    pub query_nodes_selector: u64,
    pub query_rels_selector: u64,
    /* private fields */
}

Bitset-encoded subgraph of a QueryGraph.

Fields

query_nodes_selector: u64

Bit i set when query node i is in the subgraph.

query_rels_selector: u64

Bit i set when query rel i is in the subgraph.

Implementations

impl SubqueryGraph

pub fn new(query_graph: Arc<QueryGraph>) -> Self

pub fn with_selectors( query_graph: Arc<QueryGraph>, query_nodes_selector: u64, query_rels_selector: u64, ) -> Self

pub fn single_node(query_graph: &Arc<QueryGraph>, node_pos: usize) -> Self

Subgraph holding exactly one query node.

pub fn single_rel(query_graph: &Arc<QueryGraph>, rel_pos: usize) -> Self

Subgraph holding exactly one query rel (endpoints excluded).

Rel-only singletons keep the DP lattice connected: larger subgraphs grow by attaching endpoint nodes (extend) or by hash-joining on shared nodes once both sides carry them.

pub fn query_graph(&self) -> &Arc<QueryGraph>

pub fn add_query_node(&mut self, node_pos: usize)

pub fn add_query_rel(&mut self, rel_pos: usize)

pub fn add_subquery_graph(&mut self, other: &SubqueryGraph)

pub fn contains_node(&self, node_pos: usize) -> bool

pub fn contains_rel(&self, rel_pos: usize) -> bool

pub fn is_empty(&self) -> bool

pub fn total_num_variables(&self) -> usize

Number of selected nodes plus selected rels.

pub fn num_nodes(&self) -> usize

pub fn num_rels(&self) -> usize

pub fn node_positions(&self) -> Vec<usize>

pub fn rel_positions(&self) -> Vec<usize>

pub fn get_node_neighbor_positions(&self) -> Vec<usize>

Node positions adjacent to this subgraph: endpoints of contained rels plus endpoints of frontier rels, excluding nodes already inside.

pub fn get_rel_neighbor_positions(&self) -> Vec<usize>

Rel positions adjacent to this subgraph: outside rels sharing at least one endpoint node with the subgraph (directly or through a contained rel).

pub fn get_neighbor_subgraphs(&self, target_size: usize) -> Vec<SubqueryGraph>

Enumerate connected neighbor subgraphs of exactly target_size fresh variables (disjoint from this subgraph) that touch it.

Seeds grow one variable at a time from the bipartite frontier of (self union seed): outside rels touching the combined node set and outside endpoint nodes of combined rels.

pub fn get_connected_node_positions(&self, other: &SubqueryGraph) -> Vec<usize>

Node positions present in both subgraphs (binary join keys).

pub fn is_connected(&self, other: &SubqueryGraph) -> bool

Whether the two subgraphs touch through at least one shared node.

pub fn is_extendable_with(&self, other: &SubqueryGraph) -> bool

Whether a rel on either side has an endpoint node on the other side.

Extendable pairs without shared nodes are planned as index-nested-loop extends rather than hash joins.

pub fn is_joinable_with(&self, other: &SubqueryGraph) -> bool

Whether the pair can be joined at all: shared join keys or an extend step in either direction.

pub fn key(&self) -> (u64, u64)

Selector key used by the DP table.

Trait Implementations

impl Clone for SubqueryGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SubqueryGraph

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

Formats the value using the given formatter.