Skip to main content

Crate graphforge_rel

Crate graphforge_rel 

Source
Expand description

GraphForge Graph IR → DataFusion relational lowering.

§Milestone status

  • M12 #574 — IR expression lowering to DataFusion Expr
  • M12 #573 — Wire SessionContext
  • M12 #575 — Lower simple GraphOps (Filter, Project, …)
  • M12 #576 — Lower NodeScan and Expand
  • M12 #578 — Graph-native Extension stubs + explain_logical ← this issue

Re-exports§

pub use expr::ExprLowerer;
pub use expr::LoweringError;
pub use expr::VarMap;
pub use expr::ir_literal_to_scalar;
pub use expr::scalar_to_ir_literal;
pub use lowerer::GraphPlanLowerer;

Modules§

calendar
A proleptic-Gregorian calendar on i64 days-since-epoch (#1011).
expr
IR expression arena → DataFusion [Expr] lowering.
lowerer
GraphPlanLowerer — converts a GraphPlan operator pipeline into a DataFusion LogicalPlan.
temporal
Cypher temporal-value construction, evaluated at lowering time.

Structs§

GraphPlan
A versioned, serialisable graph query plan.

Enums§

GfError
All errors produced by GraphForge.

Functions§

explain_logical
Render a GraphPlan’s optimised DataFusion LogicalPlan as indented text (with per-node schemas) for the explain LogicalPlan stage.
explain_logical_with
Like explain_logical but lowers with an optional OntologyHandle so that typed edge scans and variable-length expands can resolve relation-type names. Used by the logical-plan golden suite (which binds against a formal ontology for deterministic type IDs).
explain_logical_with_catalog
Like explain_logical_with but also threads a GraphCatalog so property accesses (e.g. n.name) resolve to their column names via the catalog’s PropId → name map instead of falling back to prop_<id> placeholders. Used by the engine facade’s explain, which lowers against the instance’s runtime catalog.
lower
Lower a GraphPlan to a DataFusion LogicalPlan.
lower_and_optimize
Lower a GraphPlan and run DataFusion’s analyzer + optimizer over it.

Type Aliases§

LogicalPlan
A DataFusion datafusion::logical_expr::LogicalPlan produced by the relational lowering pass.