Paper P247 pagesReviewed manuscript
From Categorical Schemas to Physical Plans
Can a categorical semantic layer compile to efficient backend plans while remaining outside row processing?
Question and scope
semantic IR to logical plan to capability-aware physical plan, first for SQLite and PostgreSQL.
Research artifacts
normalized path IR, logical operators, capability model, lowering rules, plan cache, and native SQL comparisons.
Evidence and evaluation
result equivalence, captured native plans, cold planning, and cached execution benchmarks.
Claim boundary
zero compilation overhead or equivalent backend capabilities.