Shared flowchart

Software · L5 · From SQL Query to Physical Plan

Sign in to clone

The pipeline from a declarative SQL query through relational algebra, plan-space search, and the serializability test that concurrency control must satisfy.

by @openstemUpdated Software
Declarative SQL queryRelational algebra: logical plan (σ, π, ⋈)Algebraic rewrites: selection push-down, join reorderingPlan space: join orders × join algorithms × access pathsCost model: cardinalities + selectivitiesSearch strategyDynamic programming (System R): exact optimumHeuristic / randomised searchPhysical plan: nested-loop / hash / sort-merge joinExecution against concurrently-running transactionsInterleaved schedule SPrecedence graph: Ti → Tj on conflicting opsConflict serializableNot serializable: reject / abortn smalln largeacycliccycle

We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy