Module com.darkcollective.relix.plan
module com.darkcollective.relix.plan
Physical query planning for the relix relational algebra system.
This module turns an optimised logical
RelNode tree into an executable
PhysicalNode plan via the
Planner. Planning fixes the physical
strategy — join algorithm (hash vs nested-loop) and build side — using the
relix-cost model, and resolves each node's output schema up front, so
the execution engine can run the plan mechanically.
-
Packages
ExportsIndirect ExportsFromPackagescom.darkcollective.relix.lang.ast com.darkcollective.relix.lang.ast.source com.darkcollective.relix.lang.ast.table -
Modules
RequiresModifierModuleDescriptiontransitiveRelational algebra AST — immutable node types, predicates, operands, and visitor infrastructure for traversal and transformation.transitiveCost estimation for relix relational algebra trees.transitiveObservability events for the relix query pipeline.transitiveThe function SPI: the description of a scalar function or aggregate that the engine reasons about, and the seam through which an implementation is supplied.transitiveSemantic analysis for.relixscripting language source files.transitiveThe mathematical-programming SPI — the seam between the engine's two mixed-integer-program operators and whatever solves them.transitiveSymbol table, type system, and relation/function symbol hierarchy for the relix system.Indirect RequiresModifierModuleDescriptiontransitiveAST node types for the relix scripting language.transitiveThe sealedValuehierarchy — the scalar values a query produces and consumes.