@quereus/quereus 0.1.0

package/dist/src/planner/nodes/function.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"function.js","sourceRoot":"","sources":["../../../../src/planner/nodes/function.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAqE,MAAM,gBAAgB,CAAC;AAC7G,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEtF,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,MAAM,OAAO,sBAAuB,SAAQ,QAAQ;IAKlC;IACA;IACA;IANC,QAAQ,GAAG,YAAY,CAAC,kBAAkB,CAAC;IAE7D,YACC,KAAY,EACI,UAA4B,EAC5B,cAA8B,EAC9B,QAA0B;QAE1C,KAAK,CAAC,KAAK,CAAC,CAAC;QAJG,eAAU,GAAV,UAAU,CAAkB;QAC5B,mBAAc,GAAd,cAAc,CAAgB;QAC9B,aAAQ,GAAR,QAAQ,CAAkB;IAG3C,CAAC;IAED,OAAO;QACN,OAAO,IAAI,CAAC,cAAc,CAAC,UAAwB,CAAC;IACrD,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,YAAY;QACX,OAAO,EAAE,CAAC;IACX,CAAC;IAED,YAAY,CAAC,WAAgC;QAC5C,IAAI,WAAW,CAAC,MAAM,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,QAAQ,CAAC,MAAM,kBAAkB,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/G,CAAC;QAED,aAAa;QACb,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YACjC,IAAI,CAAC,CAAC,YAAY,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;YACjF,CAAC;QACF,CAAC;QAED,4BAA4B;QAC5B,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,IAAI,CAAC,eAAe,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QACb,CAAC;QAED,sBAAsB;QACtB,OAAO,IAAI,sBAAsB,CAChC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,cAAc,EACnB,WAA+B,CAC/B,CAAC;IACH,CAAC;IAEQ,QAAQ;QAChB,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,oBAAoB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;IAC1E,CAAC;IAEQ,eAAe,CAAC,iBAAuC;QAC/D,gFAAgF;QAChF,MAAM,MAAM,GAAgC,EAAE,CAAC;QAE/C,yEAAyE;QACzE,MAAM,uBAAuB,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,GAAG,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAChG,MAAM,kBAAkB,GAAI,IAAI,CAAC,cAAc,CAAC,UAAyB,CAAC,UAAU,IAAI,IAAI,CAAC;QAE7F,sFAAsF;QACtF,IAAI,CAAC,uBAAuB,EAAE,CAAC;YAC9B,MAAM,CAAC,aAAa,GAAG,KAAK,CAAC;QAC9B,CAAC;QAED,4EAA4E;QAC5E,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACzB,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC;QACzB,CAAC;QAED,OAAO,MAAM,CAAC;IACf,CAAC;IAEQ,oBAAoB;QAC5B,OAAO;YACN,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YAC9B,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;YACjD,UAAU,EAAE,gBAAgB,CAAC,IAAI,CAAC,cAAc,CAAC,UAAwB,CAAC;SAC1E,CAAC;IACH,CAAC;CACD"}

package/dist/src/planner/nodes/insert-node.d.ts

@@ -0,0 +1,26 @@
+import type { Scope } from '../scopes/scope.js';
+import { PlanNode, type RelationalPlanNode, type Attribute, type RowDescriptor } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type { TableReferenceNode } from './reference.js';
+import type { ColumnDef, RelationType } from '../../common/datatype.js';
+/**
+ * Represents an INSERT statement in the logical query plan.
+ * RelationalPlanNode because this node may be a return value of a SELECT node.
+ */
+export declare class InsertNode extends PlanNode implements RelationalPlanNode {
+    readonly table: TableReferenceNode;
+    readonly targetColumns: ColumnDef[];
+    readonly source: RelationalPlanNode;
+    readonly flatRowDescriptor?: RowDescriptor | undefined;
+    readonly nodeType = PlanNodeType.Insert;
+    constructor(scope: Scope, table: TableReferenceNode, targetColumns: ColumnDef[], source: RelationalPlanNode, // Could be ValuesNode or output of a SELECT
+    flatRowDescriptor?: RowDescriptor | undefined);
+    getType(): RelationType;
+    getAttributes(): Attribute[];
+    getRelations(): readonly [RelationalPlanNode, TableReferenceNode];
+    getChildren(): readonly PlanNode[];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=insert-node.d.ts.map

package/dist/src/planner/nodes/insert-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"insert-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/insert-node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAAE,KAAK,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACvG,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAExE;;;GAGG;AACH,qBAAa,UAAW,SAAQ,QAAS,YAAW,kBAAkB;aAKlD,KAAK,EAAE,kBAAkB;aACzB,aAAa,EAAE,SAAS,EAAE;aAC1B,MAAM,EAAE,kBAAkB;aAC1B,iBAAiB,CAAC,EAAE,aAAa;IAPnD,SAAkB,QAAQ,uBAAuB;gBAG/C,KAAK,EAAE,KAAK,EACI,KAAK,EAAE,kBAAkB,EACzB,aAAa,EAAE,SAAS,EAAE,EAC1B,MAAM,EAAE,kBAAkB,EAAE,4CAA4C;IACxE,iBAAiB,CAAC,EAAE,aAAa,YAAA;IAK3C,OAAO,IAAI,YAAY;IAI/B,aAAa,IAAI,SAAS,EAAE;IAqCnB,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,WAAW,IAAI,SAAS,QAAQ,EAAE;IAI3C,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAO/C,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAazD"}

package/dist/src/planner/nodes/insert-node.js

@@ -0,0 +1,82 @@
+import { PlanNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+/**
+ * Represents an INSERT statement in the logical query plan.
+ * RelationalPlanNode because this node may be a return value of a SELECT node.
+ */
+export class InsertNode extends PlanNode {
+    table;
+    targetColumns;
+    source;
+    flatRowDescriptor;
+    nodeType = PlanNodeType.Insert;
+    constructor(scope, table, targetColumns, source, // Could be ValuesNode or output of a SELECT
+    flatRowDescriptor) {
+        super(scope);
+        this.table = table;
+        this.targetColumns = targetColumns;
+        this.source = source;
+        this.flatRowDescriptor = flatRowDescriptor;
+    }
+    getType() {
+        return this.source.getType();
+    }
+    getAttributes() {
+        // If we have a flatRowDescriptor, produce attributes that correspond to the flat OLD/NEW row structure
+        if (this.flatRowDescriptor && Object.keys(this.flatRowDescriptor).length > 0) {
+            // Create attributes for the flat row: OLD columns first, then NEW columns
+            const attributes = [];
+            // Add attributes for each position in the flat row
+            for (const attrIdStr in this.flatRowDescriptor) {
+                const attrId = parseInt(attrIdStr);
+                const flatIndex = this.flatRowDescriptor[attrId];
+                // Determine if this is OLD or NEW based on index
+                const tableColumnCount = this.table.tableSchema.columns.length;
+                const isOld = flatIndex < tableColumnCount;
+                const columnIndex = isOld ? flatIndex : flatIndex - tableColumnCount;
+                const col = this.table.tableSchema.columns[columnIndex];
+                attributes[flatIndex] = {
+                    id: attrId,
+                    name: col.name,
+                    type: {
+                        typeClass: 'scalar',
+                        affinity: col.affinity,
+                        nullable: isOld ? true : !col.notNull, // OLD values can be null, NEW follows column constraints
+                        isReadOnly: false
+                    },
+                    sourceRelation: `${isOld ? 'OLD' : 'NEW'}.${this.table.tableSchema.name}`
+                };
+            }
+            return attributes;
+        }
+        // INSERT produces the same attributes as its source (for non-RETURNING cases)
+        return this.source.getAttributes();
+    }
+    getRelations() {
+        return [this.source, this.table];
+    }
+    getChildren() {
+        return [];
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== 0) {
+            throw new Error(`InsertNode expects 0 children, got ${newChildren.length}`);
+        }
+        return this; // No children in getChildren(), source is accessed via getRelations()
+    }
+    toString() {
+        return `INSERT INTO ${this.table.tableSchema.name}`;
+    }
+    getLogicalAttributes() {
+        const props = {
+            table: this.table.tableSchema.name,
+            schema: this.table.tableSchema.schemaName,
+            targetColumns: this.targetColumns.map(col => col.name)
+        };
+        if (this.flatRowDescriptor) {
+            props.hasFlatRowDescriptor = true;
+        }
+        return props;
+    }
+}
+//# sourceMappingURL=insert-node.js.map

package/dist/src/planner/nodes/insert-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"insert-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/insert-node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAA+D,MAAM,gBAAgB,CAAC;AACvG,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAInD;;;GAGG;AACH,MAAM,OAAO,UAAW,SAAQ,QAAQ;IAKpB;IACA;IACA;IACA;IAPA,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC;IAEjD,YACE,KAAY,EACI,KAAyB,EACzB,aAA0B,EAC1B,MAA0B,EAAE,4CAA4C;IACxE,iBAAiC;QAEjD,KAAK,CAAC,KAAK,CAAC,CAAC;QALG,UAAK,GAAL,KAAK,CAAoB;QACzB,kBAAa,GAAb,aAAa,CAAa;QAC1B,WAAM,GAAN,MAAM,CAAoB;QAC1B,sBAAiB,GAAjB,iBAAiB,CAAgB;IAGnD,CAAC;IAEO,OAAO;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAEA,aAAa;QACX,uGAAuG;QACvG,IAAI,IAAI,CAAC,iBAAiB,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7E,0EAA0E;YAC1E,MAAM,UAAU,GAAgB,EAAE,CAAC;YAEnC,mDAAmD;YACnD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACnC,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;gBAEjD,iDAAiD;gBACjD,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC;gBAC/D,MAAM,KAAK,GAAG,SAAS,GAAG,gBAAgB,CAAC;gBAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,gBAAgB,CAAC;gBACrE,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBAExD,UAAU,CAAC,SAAS,CAAC,GAAG;oBACtB,EAAE,EAAE,MAAM;oBACV,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,IAAI,EAAE;wBACJ,SAAS,EAAE,QAAQ;wBACnB,QAAQ,EAAE,GAAG,CAAC,QAAQ;wBACtB,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,yDAAyD;wBAChG,UAAU,EAAE,KAAK;qBAClB;oBACD,cAAc,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE;iBAC1E,CAAC;YACJ,CAAC;YAED,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,8EAA8E;QAC9E,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC;IAEQ,YAAY;QACnB,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAEQ,WAAW;QAClB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,sCAAsC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,IAAI,CAAC,CAAC,sEAAsE;IACrF,CAAC;IAEQ,QAAQ;QACf,OAAO,eAAe,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACtD,CAAC;IAEQ,oBAAoB;QAC3B,MAAM,KAAK,GAA4B;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI;YAClC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU;YACzC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;SACvD,CAAC;QAEF,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,KAAK,CAAC,oBAAoB,GAAG,IAAI,CAAC;QACpC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/src/planner/nodes/join-node.d.ts

@@ -0,0 +1,30 @@
+import { PlanNode } from './plan-node.js';
+import type { RelationalPlanNode, Attribute, BinaryRelationalNode, ScalarPlanNode } from './plan-node.js';
+import type { RelationType } from '../../common/datatype.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type { Scope } from '../scopes/scope.js';
+export type JoinType = 'inner' | 'left' | 'right' | 'full' | 'cross';
+/**
+ * Represents a logical JOIN operation between two relations.
+ * This is a logical node that will be converted to physical join algorithms during optimization.
+ */
+export declare class JoinNode extends PlanNode implements BinaryRelationalNode {
+    readonly left: RelationalPlanNode;
+    readonly right: RelationalPlanNode;
+    readonly joinType: JoinType;
+    readonly condition?: ScalarPlanNode | undefined;
+    readonly usingColumns?: string[] | undefined;
+    readonly nodeType = PlanNodeType.Join;
+    private attributesCache;
+    constructor(scope: Scope, left: RelationalPlanNode, right: RelationalPlanNode, joinType: JoinType, condition?: ScalarPlanNode | undefined, usingColumns?: string[] | undefined);
+    private buildAttributes;
+    getAttributes(): Attribute[];
+    getType(): RelationType;
+    getChildren(): readonly PlanNode[];
+    getRelations(): readonly [RelationalPlanNode, RelationalPlanNode];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    get estimatedRows(): number | undefined;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=join-node.d.ts.map

package/dist/src/planner/nodes/join-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/join-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,KAAK,EAAE,kBAAkB,EAAE,SAAS,EAAE,oBAAoB,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAC1G,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAKhD,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC;AAErE;;;GAGG;AACH,qBAAa,QAAS,SAAQ,QAAS,YAAW,oBAAoB;aAMpD,IAAI,EAAE,kBAAkB;aACxB,KAAK,EAAE,kBAAkB;aACzB,QAAQ,EAAE,QAAQ;aAClB,SAAS,CAAC,EAAE,cAAc;aAC1B,YAAY,CAAC,EAAE,MAAM,EAAE;IATxC,QAAQ,CAAC,QAAQ,qBAAqB;IACtC,OAAO,CAAC,eAAe,CAAsB;gBAG5C,KAAK,EAAE,KAAK,EACI,IAAI,EAAE,kBAAkB,EACxB,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,QAAQ,EAClB,SAAS,CAAC,EAAE,cAAc,YAAA,EAC1B,YAAY,CAAC,EAAE,MAAM,EAAE,YAAA;IAexC,OAAO,CAAC,eAAe;IA+BvB,aAAa,IAAI,SAAS,EAAE;IAI5B,OAAO,IAAI,YAAY;IAyCvB,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAuCxD,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CA2BtC;IAEQ,QAAQ,IAAI,MAAM;IAWlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CASxD"}

package/dist/src/planner/nodes/join-node.js

@@ -0,0 +1,177 @@
+import { PlanNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import { Cached } from '../../util/cached.js';
+import { StatusCode } from '../../common/types.js';
+import { quereusError } from '../../common/errors.js';
+/**
+ * Represents a logical JOIN operation between two relations.
+ * This is a logical node that will be converted to physical join algorithms during optimization.
+ */
+export class JoinNode extends PlanNode {
+    left;
+    right;
+    joinType;
+    condition;
+    usingColumns;
+    nodeType = PlanNodeType.Join;
+    attributesCache;
+    constructor(scope, left, right, joinType, condition, usingColumns) {
+        // Cost estimate: base cost is sum of children plus join cost
+        const leftCost = left.getTotalCost();
+        const rightCost = right.getTotalCost();
+        const leftRows = left.estimatedRows ?? 100;
+        const rightRows = right.estimatedRows ?? 100;
+        // Simple join cost heuristic - nested loop cost
+        const joinCost = leftRows * rightRows;
+        super(scope, leftCost + rightCost + joinCost);
+        this.left = left;
+        this.right = right;
+        this.joinType = joinType;
+        this.condition = condition;
+        this.usingColumns = usingColumns;
+        this.attributesCache = new Cached(() => this.buildAttributes());
+    }
+    buildAttributes() {
+        const leftAttrs = this.left.getAttributes();
+        const rightAttrs = this.right.getAttributes();
+        // For JOINs, concatenate left and right attributes
+        // For OUTER joins, mark attributes from the nullable side as nullable
+        const attributes = [];
+        // Add left attributes
+        for (const attr of leftAttrs) {
+            const isNullable = this.joinType === 'right' || this.joinType === 'full';
+            attributes.push({
+                ...attr,
+                // For right/full outer joins, left side can be null
+                type: isNullable ? { ...attr.type, nullable: true } : attr.type
+            });
+        }
+        // Add right attributes
+        for (const attr of rightAttrs) {
+            const isNullable = this.joinType === 'left' || this.joinType === 'full';
+            attributes.push({
+                ...attr,
+                // For left/full outer joins, right side can be null
+                type: isNullable ? { ...attr.type, nullable: true } : attr.type
+            });
+        }
+        return attributes;
+    }
+    getAttributes() {
+        return this.attributesCache.value;
+    }
+    getType() {
+        const leftType = this.left.getType();
+        const rightType = this.right.getType();
+        // Combine column types from both sides
+        const leftColumns = leftType.columns;
+        const rightColumns = rightType.columns;
+        // For outer joins, mark columns as nullable appropriately
+        const combinedColumns = [
+            ...leftColumns.map(col => {
+                const isNullable = this.joinType === 'right' || this.joinType === 'full';
+                return isNullable ? { ...col, type: { ...col.type, nullable: true } } : col;
+            }),
+            ...rightColumns.map(col => {
+                const isNullable = this.joinType === 'left' || this.joinType === 'full';
+                return isNullable ? { ...col, type: { ...col.type, nullable: true } } : col;
+            })
+        ];
+        // Join result is a set only if both inputs are sets and it's an inner/cross join
+        // Outer joins can introduce duplicates due to null padding
+        const isSet = (this.joinType === 'inner' || this.joinType === 'cross') &&
+            leftType.isSet && rightType.isSet;
+        // Combine keys from both sides - for joins this gets complex but we'll keep it simple for now
+        const combinedKeys = [...leftType.keys, ...rightType.keys];
+        // Combine row constraints from both sides
+        const combinedRowConstraints = [...leftType.rowConstraints, ...rightType.rowConstraints];
+        return {
+            typeClass: 'relation',
+            columns: combinedColumns,
+            isSet,
+            isReadOnly: leftType.isReadOnly && rightType.isReadOnly,
+            keys: combinedKeys,
+            rowConstraints: combinedRowConstraints
+        };
+    }
+    getChildren() {
+        return this.condition ? [this.left, this.right, this.condition] : [this.left, this.right];
+    }
+    getRelations() {
+        return [this.left, this.right];
+    }
+    withChildren(newChildren) {
+        const expectedLength = this.condition ? 3 : 2;
+        if (newChildren.length !== expectedLength) {
+            quereusError(`JoinNode expects ${expectedLength} children, got ${newChildren.length}`, StatusCode.INTERNAL);
+        }
+        const [newLeft, newRight, newCondition] = newChildren;
+        // Type check
+        if (!('getAttributes' in newLeft) || typeof newLeft.getAttributes !== 'function') {
+            quereusError('JoinNode: first child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        if (!('getAttributes' in newRight) || typeof newRight.getAttributes !== 'function') {
+            quereusError('JoinNode: second child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        if (newCondition && !('expression' in newCondition)) {
+            quereusError('JoinNode: third child must be a ScalarPlanNode', StatusCode.INTERNAL);
+        }
+        // Check if anything changed
+        const leftChanged = newLeft !== this.left;
+        const rightChanged = newRight !== this.right;
+        const conditionChanged = newCondition !== this.condition;
+        if (!leftChanged && !rightChanged && !conditionChanged) {
+            return this;
+        }
+        // Create new instance - JoinNode creates new attributes by combining left and right
+        return new JoinNode(this.scope, newLeft, newRight, this.joinType, newCondition, this.usingColumns);
+    }
+    get estimatedRows() {
+        const leftRows = this.left.estimatedRows;
+        const rightRows = this.right.estimatedRows;
+        if (leftRows === undefined || rightRows === undefined) {
+            return undefined;
+        }
+        // Simple heuristics for different join types
+        switch (this.joinType) {
+            case 'cross':
+                return leftRows * rightRows;
+            case 'inner':
+                // Assume 10% selectivity for inner joins
+                return Math.max(1, leftRows * rightRows * 0.1);
+            case 'left':
+                // Left joins preserve all left rows
+                return leftRows;
+            case 'right':
+                // Right joins preserve all right rows
+                return rightRows;
+            case 'full':
+                // Full outer joins can have at most left + right rows
+                return leftRows + rightRows;
+            default:
+                return leftRows * rightRows * 0.1;
+        }
+    }
+    toString() {
+        const joinTypeDisplay = this.joinType.toUpperCase();
+        if (this.condition) {
+            return `${joinTypeDisplay} JOIN ON condition`;
+        }
+        else if (this.usingColumns) {
+            return `${joinTypeDisplay} JOIN USING(${this.usingColumns.join(', ')})`;
+        }
+        else {
+            return `${joinTypeDisplay} JOIN`;
+        }
+    }
+    getLogicalAttributes() {
+        return {
+            joinType: this.joinType,
+            hasCondition: !!this.condition,
+            usingColumns: this.usingColumns,
+            leftRows: this.left.estimatedRows,
+            rightRows: this.right.estimatedRows
+        };
+    }
+}
+//# sourceMappingURL=join-node.js.map

package/dist/src/planner/nodes/join-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/join-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAItD;;;GAGG;AACH,MAAM,OAAO,QAAS,SAAQ,QAAQ;IAMpB;IACA;IACA;IACA;IACA;IATR,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC;IAC9B,eAAe,CAAsB;IAE7C,YACC,KAAY,EACI,IAAwB,EACxB,KAAyB,EACzB,QAAkB,EAClB,SAA0B,EAC1B,YAAuB;QAEvC,6DAA6D;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,IAAI,GAAG,CAAC;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,aAAa,IAAI,GAAG,CAAC;QAE7C,gDAAgD;QAChD,MAAM,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;QACtC,KAAK,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC;QAd9B,SAAI,GAAJ,IAAI,CAAoB;QACxB,UAAK,GAAL,KAAK,CAAoB;QACzB,aAAQ,GAAR,QAAQ,CAAU;QAClB,cAAS,GAAT,SAAS,CAAiB;QAC1B,iBAAY,GAAZ,YAAY,CAAW;QAYvC,IAAI,CAAC,eAAe,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;IACjE,CAAC;IAEO,eAAe;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAE9C,mDAAmD;QACnD,sEAAsE;QACtE,MAAM,UAAU,GAAgB,EAAE,CAAC;QAEnC,sBAAsB;QACtB,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC;YACzE,UAAU,CAAC,IAAI,CAAC;gBACf,GAAG,IAAI;gBACP,oDAAoD;gBACpD,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;aAC/D,CAAC,CAAC;QACJ,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC;YACxE,UAAU,CAAC,IAAI,CAAC;gBACf,GAAG,IAAI;gBACP,oDAAoD;gBACpD,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;aAC/D,CAAC,CAAC;QACJ,CAAC;QAED,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,aAAa;QACZ,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;IACnC,CAAC;IAED,OAAO;QACN,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QAEvC,uCAAuC;QACvC,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC;QACrC,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC;QAEvC,0DAA0D;QAC1D,MAAM,eAAe,GAAG;YACvB,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;gBACxB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC;gBACzE,OAAO,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;YAC7E,CAAC,CAAC;YACF,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC;gBACxE,OAAO,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;YAC7E,CAAC,CAAC;SACF,CAAC;QAEF,iFAAiF;QACjF,2DAA2D;QAC3D,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAC;YAC5D,QAAQ,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC;QAE5C,8FAA8F;QAC9F,MAAM,YAAY,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAE3D,0CAA0C;QAC1C,MAAM,sBAAsB,GAAG,CAAC,GAAG,QAAQ,CAAC,cAAc,EAAE,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;QAEzF,OAAO;YACN,SAAS,EAAE,UAAU;YACrB,OAAO,EAAE,eAAe;YACxB,KAAK;YACL,UAAU,EAAE,QAAQ,CAAC,UAAU,IAAI,SAAS,CAAC,UAAU;YACvD,IAAI,EAAE,YAAY;YAClB,cAAc,EAAE,sBAAsB;SACtC,CAAC;IACH,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3F,CAAC;IAED,YAAY;QACX,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,YAAY,CAAC,WAAgC;QAC5C,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,WAAW,CAAC,MAAM,KAAK,cAAc,EAAE,CAAC;YAC3C,YAAY,CAAC,oBAAoB,cAAc,kBAAkB,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC7G,CAAC;QAED,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,YAAY,CAAC,GAAG,WAAW,CAAC;QAEtD,aAAa;QACb,IAAI,CAAC,CAAC,eAAe,IAAI,OAAO,CAAC,IAAI,OAAQ,OAAe,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC3F,YAAY,CAAC,oDAAoD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACzF,CAAC;QACD,IAAI,CAAC,CAAC,eAAe,IAAI,QAAQ,CAAC,IAAI,OAAQ,QAAgB,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC7F,YAAY,CAAC,qDAAqD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC1F,CAAC;QACD,IAAI,YAAY,IAAI,CAAC,CAAC,YAAY,IAAI,YAAY,CAAC,EAAE,CAAC;YACrD,YAAY,CAAC,gDAAgD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACrF,CAAC;QAED,4BAA4B;QAC5B,MAAM,WAAW,GAAG,OAAO,KAAK,IAAI,CAAC,IAAI,CAAC;QAC1C,MAAM,YAAY,GAAG,QAAQ,KAAK,IAAI,CAAC,KAAK,CAAC;QAC7C,MAAM,gBAAgB,GAAG,YAAY,KAAK,IAAI,CAAC,SAAS,CAAC;QAEzD,IAAI,CAAC,WAAW,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC;QACb,CAAC;QAED,oFAAoF;QACpF,OAAO,IAAI,QAAQ,CAClB,IAAI,CAAC,KAAK,EACV,OAA6B,EAC7B,QAA8B,EAC9B,IAAI,CAAC,QAAQ,EACb,YAA0C,EAC1C,IAAI,CAAC,YAAY,CACjB,CAAC;IACH,CAAC;IAED,IAAI,aAAa;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC;QAE3C,IAAI,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YACvD,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,6CAA6C;QAC7C,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvB,KAAK,OAAO;gBACX,OAAO,QAAQ,GAAG,SAAS,CAAC;YAC7B,KAAK,OAAO;gBACX,yCAAyC;gBACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;YAChD,KAAK,MAAM;gBACV,oCAAoC;gBACpC,OAAO,QAAQ,CAAC;YACjB,KAAK,OAAO;gBACX,sCAAsC;gBACtC,OAAO,SAAS,CAAC;YAClB,KAAK,MAAM;gBACV,sDAAsD;gBACtD,OAAO,QAAQ,GAAG,SAAS,CAAC;YAC7B;gBACC,OAAO,QAAQ,GAAG,SAAS,GAAG,GAAG,CAAC;QACpC,CAAC;IACF,CAAC;IAEQ,QAAQ;QAChB,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;QACpD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO,GAAG,eAAe,oBAAoB,CAAC;QAC/C,CAAC;aAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC9B,OAAO,GAAG,eAAe,eAAe,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACzE,CAAC;aAAM,CAAC;YACP,OAAO,GAAG,eAAe,OAAO,CAAC;QAClC,CAAC;IACF,CAAC;IAEQ,oBAAoB;QAC5B,OAAO;YACN,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,YAAY,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS;YAC9B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa;YACjC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;SACnC,CAAC;IACH,CAAC;CACD"}

package/dist/src/planner/nodes/limit-offset.d.ts

@@ -0,0 +1,24 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, type RelationalPlanNode, type UnaryRelationalNode, type ScalarPlanNode, type Attribute } from './plan-node.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { Scope } from '../scopes/scope.js';
+/**
+ * Represents a LIMIT/OFFSET operation.
+ * It takes an input relation and returns at most 'limit' rows, skipping 'offset' rows.
+ */
+export declare class LimitOffsetNode extends PlanNode implements UnaryRelationalNode {
+    readonly source: RelationalPlanNode;
+    readonly limit: ScalarPlanNode | undefined;
+    readonly offset: ScalarPlanNode | undefined;
+    readonly nodeType = PlanNodeType.LimitOffset;
+    constructor(scope: Scope, source: RelationalPlanNode, limit: ScalarPlanNode | undefined, offset: ScalarPlanNode | undefined, estimatedCostOverride?: number);
+    getType(): RelationType;
+    getAttributes(): Attribute[];
+    getChildren(): readonly PlanNode[];
+    getRelations(): readonly [RelationalPlanNode];
+    get estimatedRows(): number | undefined;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+}
+//# sourceMappingURL=limit-offset.d.ts.map

package/dist/src/planner/nodes/limit-offset.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"limit-offset.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/limit-offset.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,mBAAmB,EAAE,KAAK,cAAc,EAAE,KAAK,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAClI,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAKhD;;;GAGG;AACH,qBAAa,eAAgB,SAAQ,QAAS,YAAW,mBAAmB;aAKxD,MAAM,EAAE,kBAAkB;aAC1B,KAAK,EAAE,cAAc,GAAG,SAAS;aACjC,MAAM,EAAE,cAAc,GAAG,SAAS;IANpD,SAAkB,QAAQ,4BAA4B;gBAGpD,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,KAAK,EAAE,cAAc,GAAG,SAAS,EACjC,MAAM,EAAE,cAAc,GAAG,SAAS,EAClD,qBAAqB,CAAC,EAAE,MAAM;IAOhC,OAAO,IAAI,YAAY;IAKvB,aAAa,IAAI,SAAS,EAAE;IAK5B,WAAW,IAAI,SAAS,QAAQ,EAAE;IAOlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAUtC;IAEQ,QAAQ,IAAI,MAAM;IAOlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAcxD,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;CA2CzD"}

package/dist/src/planner/nodes/limit-offset.js

@@ -0,0 +1,103 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode } from './plan-node.js';
+import { formatExpression } from '../../util/plan-formatter.js';
+import { quereusError } from '../../common/errors.js';
+import { StatusCode } from '../../common/types.js';
+/**
+ * Represents a LIMIT/OFFSET operation.
+ * It takes an input relation and returns at most 'limit' rows, skipping 'offset' rows.
+ */
+export class LimitOffsetNode extends PlanNode {
+    source;
+    limit;
+    offset;
+    nodeType = PlanNodeType.LimitOffset;
+    constructor(scope, source, limit, offset, estimatedCostOverride) {
+        // Cost is proportional to offset + limit (rows we need to process)
+        // We assume limit and offset are constants, but in practice they could be expressions
+        super(scope, estimatedCostOverride ?? source.getTotalCost());
+        this.source = source;
+        this.limit = limit;
+        this.offset = offset;
+    }
+    getType() {
+        // LIMIT/OFFSET preserves the type of the source relation
+        return this.source.getType();
+    }
+    getAttributes() {
+        // LIMIT/OFFSET preserves the same attributes as its source
+        return this.source.getAttributes();
+    }
+    getChildren() {
+        const children = [this.source];
+        if (this.limit)
+            children.push(this.limit);
+        if (this.offset)
+            children.push(this.offset);
+        return children;
+    }
+    getRelations() {
+        return [this.source];
+    }
+    get estimatedRows() {
+        const sourceRows = this.source.estimatedRows;
+        if (sourceRows === undefined)
+            return undefined;
+        // TODO: Evaluate limit/offset if they are constants
+        // For now, assume limit is 100 if specified, otherwise use source rows
+        if (this.limit) {
+            return Math.min(sourceRows, 100);
+        }
+        return sourceRows;
+    }
+    toString() {
+        const parts = [];
+        if (this.limit)
+            parts.push(`LIMIT ${formatExpression(this.limit)}`);
+        if (this.offset)
+            parts.push(`OFFSET ${formatExpression(this.offset)}`);
+        return parts.join(' ');
+    }
+    getLogicalAttributes() {
+        const props = {};
+        if (this.limit) {
+            props.limit = formatExpression(this.limit);
+        }
+        if (this.offset) {
+            props.offset = formatExpression(this.offset);
+        }
+        return props;
+    }
+    withChildren(newChildren) {
+        const expectedLength = 1 + (this.limit ? 1 : 0) + (this.offset ? 1 : 0);
+        if (newChildren.length !== expectedLength) {
+            quereusError(`LimitOffsetNode expects ${expectedLength} children, got ${newChildren.length}`, StatusCode.INTERNAL);
+        }
+        const [newSource, ...restChildren] = newChildren;
+        // Type check
+        if (!('getAttributes' in newSource) || typeof newSource.getAttributes !== 'function') {
+            quereusError('LimitOffsetNode: first child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        // Parse optional limit and offset from remaining children
+        let newLimit = undefined;
+        let newOffset = undefined;
+        let childIndex = 0;
+        if (this.limit) {
+            newLimit = restChildren[childIndex];
+            childIndex++;
+        }
+        if (this.offset) {
+            newOffset = restChildren[childIndex];
+        }
+        // Check if anything changed
+        const sourceChanged = newSource !== this.source;
+        const limitChanged = newLimit !== this.limit;
+        const offsetChanged = newOffset !== this.offset;
+        if (!sourceChanged && !limitChanged && !offsetChanged) {
+            return this;
+        }
+        // Create new instance preserving attributes (limit/offset preserves source attributes)
+        return new LimitOffsetNode(this.scope, newSource, newLimit, newOffset);
+    }
+}
+//# sourceMappingURL=limit-offset.js.map

package/dist/src/planner/nodes/limit-offset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"limit-offset.js","sourceRoot":"","sources":["../../../../src/planner/nodes/limit-offset.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAA0F,MAAM,gBAAgB,CAAC;AAGlI,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAEnD;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAKzB;IACA;IACA;IANA,QAAQ,GAAG,YAAY,CAAC,WAAW,CAAC;IAEtD,YACE,KAAY,EACI,MAA0B,EAC1B,KAAiC,EACjC,MAAkC,EAClD,qBAA8B;QAE9B,mEAAmE;QACnE,sFAAsF;QACtF,KAAK,CAAC,KAAK,EAAE,qBAAqB,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;QAP7C,WAAM,GAAN,MAAM,CAAoB;QAC1B,UAAK,GAAL,KAAK,CAA4B;QACjC,WAAM,GAAN,MAAM,CAA4B;IAMpD,CAAC;IAED,OAAO;QACL,yDAAyD;QACzD,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,aAAa;QACX,2DAA2D;QAC3D,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC;IAED,WAAW;QACT,MAAM,QAAQ,GAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,KAAK;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,YAAY;QACV,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,aAAa;QACf,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAC7C,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAE/C,oDAAoD;QACpD,uEAAuE;QACvE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEQ,QAAQ;QACf,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpE,IAAI,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAEQ,oBAAoB;QAC3B,MAAM,KAAK,GAA4B,EAAE,CAAC;QAE1C,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,KAAK,CAAC,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,KAAK,CAAC,MAAM,GAAG,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI,WAAW,CAAC,MAAM,KAAK,cAAc,EAAE,CAAC;YAC1C,YAAY,CAAC,2BAA2B,cAAc,kBAAkB,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACrH,CAAC;QAED,MAAM,CAAC,SAAS,EAAE,GAAG,YAAY,CAAC,GAAG,WAAW,CAAC;QAEjD,aAAa;QACb,IAAI,CAAC,CAAC,eAAe,IAAI,SAAS,CAAC,IAAI,OAAQ,SAAiB,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC9F,YAAY,CAAC,2DAA2D,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACjG,CAAC;QAED,0DAA0D;QAC1D,IAAI,QAAQ,GAA+B,SAAS,CAAC;QACrD,IAAI,SAAS,GAA+B,SAAS,CAAC;QACtD,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,QAAQ,GAAG,YAAY,CAAC,UAAU,CAAmB,CAAC;YACtD,UAAU,EAAE,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,SAAS,GAAG,YAAY,CAAC,UAAU,CAAmB,CAAC;QACzD,CAAC;QAED,4BAA4B;QAC5B,MAAM,aAAa,GAAG,SAAS,KAAK,IAAI,CAAC,MAAM,CAAC;QAChD,MAAM,YAAY,GAAG,QAAQ,KAAK,IAAI,CAAC,KAAK,CAAC;QAC7C,MAAM,aAAa,GAAG,SAAS,KAAK,IAAI,CAAC,MAAM,CAAC;QAEhD,IAAI,CAAC,aAAa,IAAI,CAAC,YAAY,IAAI,CAAC,aAAa,EAAE,CAAC;YACtD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,uFAAuF;QACvF,OAAO,IAAI,eAAe,CACxB,IAAI,CAAC,KAAK,EACV,SAA+B,EAC/B,QAAQ,EACR,SAAS,CACV,CAAC;IACJ,CAAC;CACF"}

package/dist/src/planner/nodes/physical-access-nodes.d.ts

@@ -0,0 +1,83 @@
+/**
+* Physical table access nodes for seek and range scan operations
+ * These replace logical TableScanNode during optimization
+ */
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, type UnaryRelationalNode, type PhysicalProperties, type Attribute } from './plan-node.js';
+import { TableReferenceNode } from './reference.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { Scope } from '../scopes/scope.js';
+import type { FilterInfo } from '../../vtab/filter-info.js';
+import type { ScalarPlanNode } from './plan-node.js';
+/**
+ * Base class for physical table access operations
+ * Provides common functionality for sequential scan, index scan, and index seek
+ */
+export declare abstract class PhysicalTableAccessNode extends PlanNode implements UnaryRelationalNode {
+    readonly source: TableReferenceNode;
+    readonly filterInfo: FilterInfo;
+    private attributesCache;
+    private outputType;
+    constructor(scope: Scope, source: TableReferenceNode, filterInfo: FilterInfo, estimatedCostOverride?: number);
+    getAttributes(): Attribute[];
+    getType(): RelationType;
+    getChildren(): readonly PlanNode[];
+    getRelations(): readonly [TableReferenceNode];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+/**
+ * Sequential scan - reads entire table without using indexes
+ * Used when no suitable index exists or for small tables
+ */
+export declare class SeqScanNode extends PhysicalTableAccessNode {
+    readonly nodeType = PlanNodeType.SeqScan;
+    computePhysical(): Partial<PhysicalProperties>;
+    toString(): string;
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+}
+/**
+ * Index scan - uses an index to read table data in order
+ * Provides ordering and can handle range queries efficiently
+ */
+export declare class IndexScanNode extends PhysicalTableAccessNode {
+    readonly indexName: string;
+    readonly providesOrdering?: {
+        column: number;
+        desc: boolean;
+    }[] | undefined;
+    readonly nodeType = PlanNodeType.IndexScan;
+    constructor(scope: Scope, source: TableReferenceNode, filterInfo: FilterInfo, indexName: string, providesOrdering?: {
+        column: number;
+        desc: boolean;
+    }[] | undefined, estimatedCostOverride?: number);
+    computePhysical(): Partial<PhysicalProperties>;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+}
+/**
+ * Index seek - point lookup or tight range using an index
+ * Very efficient for equality constraints and small ranges
+ */
+export declare class IndexSeekNode extends PhysicalTableAccessNode {
+    readonly indexName: string;
+    readonly seekKeys: ScalarPlanNode[];
+    readonly isRange: boolean;
+    readonly providesOrdering?: {
+        column: number;
+        desc: boolean;
+    }[] | undefined;
+    readonly nodeType = PlanNodeType.IndexSeek;
+    constructor(scope: Scope, source: TableReferenceNode, filterInfo: FilterInfo, indexName: string, seekKeys: ScalarPlanNode[], isRange?: boolean, providesOrdering?: {
+        column: number;
+        desc: boolean;
+    }[] | undefined, estimatedCostOverride?: number);
+    computePhysical(): Partial<PhysicalProperties>;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+    getSeekKeys(): readonly ScalarPlanNode[];
+    getChildren(): readonly PlanNode[];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+}
+//# sourceMappingURL=physical-access-nodes.d.ts.map

package/dist/src/planner/nodes/physical-access-nodes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"physical-access-nodes.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/physical-access-nodes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,mBAAmB,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC7G,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAEhD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAErD;;;GAGG;AACH,8BAAsB,uBAAwB,SAAQ,QAAS,YAAW,mBAAmB;aAM3E,MAAM,EAAE,kBAAkB;aAC1B,UAAU,EAAE,UAAU;IANvC,OAAO,CAAC,eAAe,CAAsB;IAC7C,OAAO,CAAC,UAAU,CAAuB;gBAGxC,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,UAAU,EAAE,UAAU,EACtC,qBAAqB,CAAC,EAAE,MAAM;IAQ/B,aAAa,IAAI,SAAS,EAAE;IAI5B,OAAO,IAAI,YAAY;IAIvB,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAqB/C,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAaxD;AAED;;;GAGG;AACH,qBAAa,WAAY,SAAQ,uBAAuB;IACvD,SAAkB,QAAQ,wBAAwB;IAElD,eAAe,IAAI,OAAO,CAAC,kBAAkB,CAAC;IASrC,QAAQ,IAAI,MAAM;IAIlB,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;CAwBjE;AAED;;;GAGG;AACH,qBAAa,aAAc,SAAQ,uBAAuB;aAOxC,SAAS,EAAE,MAAM;aACjB,gBAAgB,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAA;KAAE,EAAE;IAPvE,SAAkB,QAAQ,0BAA0B;gBAGnD,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,kBAAkB,EAC1B,UAAU,EAAE,UAAU,EACN,SAAS,EAAE,MAAM,EACjB,gBAAgB,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAA;KAAE,EAAE,YAAA,EACtE,qBAAqB,CAAC,EAAE,MAAM;IAK/B,eAAe,IAAI,OAAO,CAAC,kBAAkB,CAAC;IASrC,QAAQ,IAAI,MAAM;IAOlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAQ/C,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;CA0BjE;AAED;;;GAGG;AACH,qBAAa,aAAc,SAAQ,uBAAuB;aAOxC,SAAS,EAAE,MAAM;aACjB,QAAQ,EAAE,cAAc,EAAE;aAC1B,OAAO,EAAE,OAAO;aAChB,gBAAgB,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAA;KAAE,EAAE;IATvE,SAAkB,QAAQ,0BAA0B;gBAGnD,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,kBAAkB,EAC1B,UAAU,EAAE,UAAU,EACN,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,cAAc,EAAE,EAC1B,OAAO,GAAE,OAAe,EACxB,gBAAgB,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAA;KAAE,EAAE,YAAA,EACtE,qBAAqB,CAAC,EAAE,MAAM;IAK/B,eAAe,IAAI,OAAO,CAAC,kBAAkB,CAAC;IAUrC,QAAQ,IAAI,MAAM;IAQlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAUxD,WAAW,IAAI,SAAS,cAAc,EAAE;IAI/B,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;CAuCjE"}