Struct FrozenIndexedDataset 

pub struct FrozenIndexedDataset {
    pub stats: DatasetStatistics,
    /* private fields */
}

Immutable, dictionary-encoded snapshot of a post-inference RDF dataset. Intended to be built once at the inference→validation boundary and shared across all per-focus-node SPARQL evaluations.

Fields

stats: DatasetStatistics

Implementations

impl FrozenIndexedDataset

pub fn from_graph(graph: &Graph) -> Self

Build from a single graph loaded into the default graph slot.

pub fn from_graph_union(left: &Graph, right: &Graph) -> Self

Build a default graph from the set union of two source graphs without materializing an intermediate Graph.

pub fn from_graphs(context: &Graph, shapes: &Graph) -> Self

Build with context in the default graph and shapes in the named graph urn:x-shacl:shapes-graph, mirroring what SparqlExecutor::build does with the Oxigraph Store.

pub fn from_graph_union_with_shapes(data: &Graph, shapes: &Graph) -> Self

Build a union default graph while also exposing shapes through the named $shapesGraph slot.

Trait Implementations

impl PathBackend for FrozenIndexedDataset

Indexed backend over the dictionary-encoded post-inference snapshot. Built once at the inference→validation boundary and shared across focus nodes; the u32-keyed sorted indexes replace per-call term hashing and B-tree walks. Unknown terms intern to fresh ids that match no stored triple — exactly the empty-result semantics path evaluation needs.

fn objects(&self, subject: &Term, predicate: &NamedNode) -> HashSet<Term>

{ o | (subject, predicate, o) ∈ G } — forward step.

fn subjects(&self, predicate: &NamedNode, object: &Term) -> HashSet<Term>

{ s | (s, predicate, object) ∈ G } — backward step.

fn out_predicates(&self, subject: &Term) -> BTreeSet<NamedNode>

Predicates of the outgoing triples of subject (used by sh:closed).

impl<'a> QueryableDataset<'a> for &'a FrozenIndexedDataset

type InternalTerm = u32

Internal representation of an RDF term

type Error = Infallible

Error returned by the dataset.

fn internal_quads_for_pattern( &self, subject: Option<&TermId>, predicate: Option<&TermId>, object: Option<&TermId>, graph_name: Option<Option<&TermId>>, ) -> Box<dyn Iterator<Item = Result<InternalQuad<TermId>, Infallible>> + 'a>

Fetches quads according to a pattern

fn internalize_term(&self, term: Term) -> Result<TermId, Infallible>

Builds an internal term from the Term struct

fn externalize_term(&self, id: TermId) -> Result<Term, Infallible>

Builds a Term from an internal term

fn internal_named_graphs( &self, ) -> impl Iterator<Item = Result<Self::InternalTerm, Self::Error>> + use<'a, Self>

Fetches the list of dataset named graphs

fn contains_internal_graph_name( &self, graph_name: &Self::InternalTerm, ) -> Result<bool, Self::Error>

Returns if the dataset contains a given named graph

fn externalize_expression_term( &self, term: Self::InternalTerm, ) -> Result<ExpressionTerm, Self::Error>

Builds an ExpressionTerm from an internal term

fn internalize_expression_term( &self, term: ExpressionTerm, ) -> Result<Self::InternalTerm, Self::Error>

Builds an internal term from an ExpressionTerm

fn internal_term_effective_boolean_value( &self, term: Self::InternalTerm, ) -> Result<Option<bool>, Self::Error>

Computes the term Effective boolean value