@quereus/quereus 0.16.4 → 0.17.1

package/dist/src/vtab/memory/layer/transaction.js

@@ -20,6 +20,7 @@ export class TransactionLayer {
     // Secondary index BTrees that inherit from parent's indexes
     secondaryIndexes;
     _isCommitted = false;
+    _hasModifications = false;
     /** Pending changes for event emission. Null if tracking disabled. */
     pendingChanges = null;
     // Cache for BTree funcs to avoid recalculation
@@ -101,6 +102,7 @@ export class TransactionLayer {
         if (source.pendingChanges) {
             this.pendingChanges = [...source.pendingChanges];
         }
+        this._hasModifications = source._hasModifications;
     }
     getPkExtractorsAndComparators(schema) {
         if (schema !== this.tableSchemaAtCreation) {
@@ -126,6 +128,7 @@ export class TransactionLayer {
     recordUpsert(primaryKey, newRowData, oldRowDataIfUpdate) {
         if (this._isCommitted)
             throw new QuereusError("Cannot modify a committed layer");
+        this._hasModifications = true;
         this.primaryModifications.upsert(newRowData);
         // Track change for event emission
         if (this.pendingChanges) {
@@ -168,6 +171,7 @@ export class TransactionLayer {
     recordDelete(primaryKey, oldRowDataForIndexes) {
         if (this._isCommitted)
             throw new QuereusError("Cannot modify a committed layer");
+        this._hasModifications = true;
         // Find the existing entry
         const existingPath = this.primaryModifications.find(primaryKey);
         if (existingPath.on) {
@@ -197,32 +201,14 @@ export class TransactionLayer {
         }
     }
     hasChanges() {
-        // Check if primary modifications BTree has any entries beyond its base
-        if (this.primaryModifications.getCount() > 0) {
-            // Note: getCount() might include inherited entries, so we need a better way
-            // to check if this layer has modifications. This depends on inheritree's API.
-            // For now, assume any count > 0 means changes (might need refinement)
-            return true;
-        }
-        // Check secondary indexes for changes
-        for (const memoryIndex of this.secondaryIndexes.values()) {
-            if (memoryIndex.size > 0) {
-                // Same caveat as above - this might include inherited entries
-                return true;
-            }
-        }
-        return false;
+        return this._hasModifications;
     }
     /**
      * Detaches this layer's BTrees from their base, making them self-contained.
      * This should be called when the layer becomes the new effective base.
      */
     clearBase() {
-        // Clear base for primary modifications
-        if (typeof this.primaryModifications.clearBase === 'function') {
-            this.primaryModifications.clearBase();
-        }
-        // Clear base for secondary indexes
+        this.primaryModifications.clearBase();
         for (const memoryIndex of this.secondaryIndexes.values()) {
             memoryIndex.clearBase();
         }

package/dist/src/vtab/memory/layer/transaction.js.map

@@ -1 +1 @@
-{"version":3,"file":"transaction.js","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/transaction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAI1C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,MAAM,GAAG,GAAG,YAAY,CAAC,+BAA+B,CAAC,CAAC;AAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAEnC,IAAI,uBAAuB,GAAG,IAAI,CAAC;AAYnC;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACX,OAAO,CAAS;IACjB,WAAW,CAAQ;IAClB,qBAAqB,CAAc,CAAC,qCAAqC;IAE1F,wDAAwD;IAChD,oBAAoB,CAAiC;IAE7D,4DAA4D;IACpD,gBAAgB,CAA2B;IAE3C,YAAY,GAAY,KAAK,CAAC;IAEtC,qEAAqE;IAC7D,cAAc,GAA2B,IAAI,CAAC;IAEtD,+CAA+C;IACvC,+BAA+B,GAKlC,IAAI,GAAG,EAAE,CAAC;IAEf,YAAY,MAAa;QACxB,IAAI,CAAC,OAAO,GAAG,uBAAuB,EAAE,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;QAC1B,IAAI,CAAC,qBAAqB,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,8BAA8B;QAE/E,4EAA4E;QAC5E,MAAM,EAAE,0BAA0B,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5H,MAAM,iBAAiB,GAAG,CAAC,KAAU,EAAsB,EAAE;YAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;QAEF,MAAM,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAEhE,IAAI,CAAC,oBAAoB,GAAG,IAAI,KAAK,CACpC,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,IAAI,SAAS,CAAC,oCAAoC;SACnE,CAAC;QAEF,4EAA4E;QAC5E,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;IACnC,CAAC;IAEO,0BAA0B;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QAE5B,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvF,0CAA0C;YAC1C,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,WAAW,EACX,MAAM,CAAC,OAAO,EACd,mBAAmB,IAAI,SAAS,CAAC,4CAA4C;aAC7E,CAAC;YACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;IAED,UAAU;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,SAAS;QACR,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED,SAAS;QACR,4DAA4D;QAC5D,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACnC,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED,yEAAyE;IACzE,aAAa;QACZ,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,oFAAoF;QACrF,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,oBAAoB;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QAC1B,CAAC;IACF,CAAC;IAED;;OAEG;IACH,iBAAiB;QAChB,OAAO,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,iBAAiB;QAChB,OAAO,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,MAAwB;QAC9C,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;YAC3B,IAAI,CAAC,cAAc,GAAG,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;QAClD,CAAC;IACF,CAAC;IAEM,6BAA6B,CAAC,MAAmB;QAIvD,IAAI,MAAM,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC3C,OAAO,CAAC,gIAAgI,CAAC,CAAC;QAC3I,CAAC;QAED,6EAA6E;QAC7E,oEAAoE;QACpE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC1E,OAAO;YACN,0BAA0B,EAAE,WAAW,CAAC,cAAc;YACtD,oBAAoB,EAAE,WAAW,CAAC,OAAO;SACzC,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,SAA6B;QAChD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC;QAC9D,OAAO,IAAI,CAAC,CAAC,2DAA2D;IACzE,CAAC;IAED,qBAAqB,CAAC,SAAiB;QACtC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;IAC3D,CAAC;IAED,4DAA4D;IAC5D,YAAY,CAAC,UAA8B,EAAE,UAAe,EAAE,kBAA+B;QAC5F,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAE7C,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;gBAC9C,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,kBAAkB,IAAI,SAAS;gBACvC,MAAM,EAAE,UAAU;aAClB,CAAC,CAAC;QACJ,CAAC;QAED,2BAA2B;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,IAAI,kBAAkB,EAAE,CAAC,CAAC,SAAS;oBAClC,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBAEvD,+CAA+C;oBAC/C,IAAI,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACP,2DAA2D;wBAC3D,oEAAoE;wBACpE,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;gBACF,CAAC;qBAAM,CAAC,CAAC,SAAS;oBACjB,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,iDAAiD;IACjD,YAAY,CAAC,UAA8B,EAAE,oBAAyB;QACrE,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,IAAI,YAAY,CAAC,EAAE,EAAE,CAAC;YACrB,kEAAkE;YAClE,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QACD,8EAA8E;QAC9E,4DAA4D;QAE5D,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,oBAAoB;aAC5B,CAAC,CAAC;QACJ,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;gBACjE,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;IACF,CAAC;IAEM,UAAU;QAChB,uEAAuE;QACvE,IAAI,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC;YAC9C,4EAA4E;YAC5E,8EAA8E;YAC9E,sEAAsE;YACtE,OAAO,IAAI,CAAC;QACb,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1B,8DAA8D;gBAC9D,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,SAAS;QACf,uCAAuC;QACvC,IAAI,OAAQ,IAAI,CAAC,oBAA4B,CAAC,SAAS,KAAK,UAAU,EAAE,CAAC;YACvE,IAAI,CAAC,oBAA4B,CAAC,SAAS,EAAE,CAAC;QAChD,CAAC;QAED,mCAAmC;QACnC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,WAAW,CAAC,SAAS,EAAE,CAAC;QACzB,CAAC;IACF,CAAC;CACD"}
+{"version":3,"file":"transaction.js","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/transaction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAI1C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,MAAM,GAAG,GAAG,YAAY,CAAC,+BAA+B,CAAC,CAAC;AAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAEnC,IAAI,uBAAuB,GAAG,IAAI,CAAC;AAYnC;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACX,OAAO,CAAS;IACjB,WAAW,CAAQ;IAClB,qBAAqB,CAAc,CAAC,qCAAqC;IAE1F,wDAAwD;IAChD,oBAAoB,CAAiC;IAE7D,4DAA4D;IACpD,gBAAgB,CAA2B;IAE3C,YAAY,GAAY,KAAK,CAAC;IAC9B,iBAAiB,GAAY,KAAK,CAAC;IAE3C,qEAAqE;IAC7D,cAAc,GAA2B,IAAI,CAAC;IAEtD,+CAA+C;IACvC,+BAA+B,GAKlC,IAAI,GAAG,EAAE,CAAC;IAEf,YAAY,MAAa;QACxB,IAAI,CAAC,OAAO,GAAG,uBAAuB,EAAE,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;QAC1B,IAAI,CAAC,qBAAqB,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,8BAA8B;QAE/E,4EAA4E;QAC5E,MAAM,EAAE,0BAA0B,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5H,MAAM,iBAAiB,GAAG,CAAC,KAAU,EAAsB,EAAE;YAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;QAEF,MAAM,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAEhE,IAAI,CAAC,oBAAoB,GAAG,IAAI,KAAK,CACpC,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,IAAI,SAAS,CAAC,oCAAoC;SACnE,CAAC;QAEF,4EAA4E;QAC5E,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;IACnC,CAAC;IAEO,0BAA0B;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QAE5B,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvF,0CAA0C;YAC1C,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,WAAW,EACX,MAAM,CAAC,OAAO,EACd,mBAAmB,IAAI,SAAS,CAAC,4CAA4C;aAC7E,CAAC;YACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;IAED,UAAU;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,SAAS;QACR,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED,SAAS;QACR,4DAA4D;QAC5D,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACnC,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED,yEAAyE;IACzE,aAAa;QACZ,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,oFAAoF;QACrF,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,oBAAoB;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QAC1B,CAAC;IACF,CAAC;IAED;;OAEG;IACH,iBAAiB;QAChB,OAAO,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,iBAAiB;QAChB,OAAO,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,MAAwB;QAC9C,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;YAC3B,IAAI,CAAC,cAAc,GAAG,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACnD,CAAC;IAEM,6BAA6B,CAAC,MAAmB;QAIvD,IAAI,MAAM,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC3C,OAAO,CAAC,gIAAgI,CAAC,CAAC;QAC3I,CAAC;QAED,6EAA6E;QAC7E,oEAAoE;QACpE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC1E,OAAO;YACN,0BAA0B,EAAE,WAAW,CAAC,cAAc;YACtD,oBAAoB,EAAE,WAAW,CAAC,OAAO;SACzC,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,SAA6B;QAChD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC;QAC9D,OAAO,IAAI,CAAC,CAAC,2DAA2D;IACzE,CAAC;IAED,qBAAqB,CAAC,SAAiB;QACtC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;IAC3D,CAAC;IAED,4DAA4D;IAC5D,YAAY,CAAC,UAA8B,EAAE,UAAe,EAAE,kBAA+B;QAC5F,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAE7C,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;gBAC9C,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,kBAAkB,IAAI,SAAS;gBACvC,MAAM,EAAE,UAAU;aAClB,CAAC,CAAC;QACJ,CAAC;QAED,2BAA2B;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,IAAI,kBAAkB,EAAE,CAAC,CAAC,SAAS;oBAClC,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBAEvD,+CAA+C;oBAC/C,IAAI,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACP,2DAA2D;wBAC3D,oEAAoE;wBACpE,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;gBACF,CAAC;qBAAM,CAAC,CAAC,SAAS;oBACjB,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,iDAAiD;IACjD,YAAY,CAAC,UAA8B,EAAE,oBAAyB;QACrE,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,IAAI,YAAY,CAAC,EAAE,EAAE,CAAC;YACrB,kEAAkE;YAClE,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QACD,8EAA8E;QAC9E,4DAA4D;QAE5D,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,oBAAoB;aAC5B,CAAC,CAAC;QACJ,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;gBACjE,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;IACF,CAAC;IAEM,UAAU;QAChB,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,SAAS;QACf,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,CAAC;QACtC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,WAAW,CAAC,SAAS,EAAE,CAAC;QACzB,CAAC;IACF,CAAC;CACD"}

package/dist/src/vtab/memory/module.d.ts

@@ -1,7 +1,7 @@
 import type { Database } from '../../core/database.js';
 import { type TableSchema, type IndexSchema } from '../../schema/table.js';
 import { MemoryTable } from './table.js';
-import type { VirtualTableModule } from '../module.js';
+import type { VirtualTableModule, SchemaChangeInfo } from '../module.js';
 import { MemoryTableManager } from './layer/manager.js';
 import type { MemoryTableConfig } from './types.js';
 import type { BestAccessPlanRequest, BestAccessPlanResult } from '../best-access-plan.js';
@@ -32,15 +32,11 @@ export declare class MemoryTableModule implements VirtualTableModule<MemoryTable
     /**
      * Connects to an existing memory table definition
      */
-    connect(db: Database, pAux: unknown, moduleName: string, schemaName: string, tableName: string, _options: MemoryTableConfig, _tableSchema?: TableSchema): Promise<MemoryTable>;
+    connect(db: Database, pAux: unknown, moduleName: string, schemaName: string, tableName: string, options: MemoryTableConfig, _tableSchema?: TableSchema): Promise<MemoryTable>;
     /**
      * Modern, type-safe access planning interface
      */
     getBestAccessPlan(db: Database, tableInfo: TableSchema, request: BestAccessPlanRequest): BestAccessPlanResult;
-    /**
-     * Build column metadata for access planning
-     */
-    private buildColumnMetadata;
     /**
      * Find the best access plan for the given request
      */
@@ -50,7 +46,9 @@ export declare class MemoryTableModule implements VirtualTableModule<MemoryTable
      */
     private evaluateIndexAccess;
     /**
-     * Find equality matches for index columns
+     * Find equality matches for index columns (prefix matching).
+     * Handles `=`, single-value `IN`, and multi-value `IN` as equality constraints.
+     * Returns the total cardinality (product of IN list sizes) for cost estimation.
      */
     private findEqualityMatches;
     /**
@@ -65,28 +63,20 @@ export declare class MemoryTableModule implements VirtualTableModule<MemoryTable
      * Check if an index can satisfy ordering requirements
      */
     private indexSatisfiesOrdering;
-    private createPlanningContext;
     private gatherAvailableIndexes;
-    private findBestPlan;
-    private createInitialPlan;
-    private evaluateIndexPlan;
-    private evaluateEqualityPlan;
-    private findEqualityConstraints;
-    private canUseEqualityPlan;
-    private evaluateRangePlan;
-    private findRangeBounds;
-    private evaluateOrderByConsumption;
-    private checkOrderByConsumption;
-    private adjustPlanTypeForOrder;
-    private ensureFallbackPlan;
-    private populateIndexInfoOutput;
-    private buildConstraintUsage;
-    private buildIndexString;
-    private createArgvMapping;
     /**
      * Destroys a memory table and frees associated resources
      */
     destroy(db: Database, pAux: unknown, moduleName: string, schemaName: string, tableName: string): Promise<void>;
+    /**
+     * Renames a memory table's internal registration key.
+     * Called by the ALTER TABLE RENAME TO emitter after schema update.
+     */
+    renameTable(schemaName: string, oldName: string, newName: string): void;
+    /**
+     * Alters an existing memory table's structure (ADD/DROP/RENAME COLUMN).
+     */
+    alterTable(db: Database, schemaName: string, tableName: string, change: SchemaChangeInfo): Promise<TableSchema>;
     /**
      * Creates an index on a memory table
      */

package/dist/src/vtab/memory/module.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"module.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/module.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAAqB,MAAM,uBAAuB,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAGvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAGpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,oBAAoB,EAAiD,MAAM,wBAAwB,CAAC;AACzI,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAI7D;;;;GAIG;AACH,qBAAa,iBAAkB,YAAW,kBAAkB,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAC3F,SAAgB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAa;IACpE,OAAO,CAAC,YAAY,CAAC,CAAqB;gBAE9B,YAAY,CAAC,EAAE,kBAAkB;IAI7C;;OAEG;IACH,eAAe,IAAI,kBAAkB,GAAG,SAAS;IAIjD;;;OAGG;IACH,eAAe,IAAI,kBAAkB;IAUrC;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAuC1E;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,YAAY,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAcpL;;OAEG;IACH,iBAAiB,CAChB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,qBAAqB,GAC5B,oBAAoB;IAiBvB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAU3B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAsC1B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA0C3B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA6B3B;;OAEG;IACH,OAAO,CAAC,cAAc;IAwBtB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAyB7B;;OAEG;IACF,OAAO,CAAC,sBAAsB;IAuB/B,OAAO,CAAC,qBAAqB;IAmB7B,OAAO,CAAC,sBAAsB;IAgB9B,OAAO,CAAC,YAAY;IAapB,OAAO,CAAC,iBAAiB;IAYzB,OAAO,CAAC,iBAAiB;IAyBzB,OAAO,CAAC,oBAAoB;IAyB5B,OAAO,CAAC,uBAAuB;IA4B/B,OAAO,CAAC,kBAAkB;IAI1B,OAAO,CAAC,iBAAiB;IA8BzB,OAAO,CAAC,eAAe;IAsBvB,OAAO,CAAC,0BAA0B;IA6BlC,OAAO,CAAC,uBAAuB;IAmB/B,OAAO,CAAC,sBAAsB;IAQ9B,OAAO,CAAC,kBAAkB;IAa1B,OAAO,CAAC,uBAAuB;IAa/B,OAAO,CAAC,oBAAoB;IAe5B,OAAO,CAAC,gBAAgB;IAqBxB,OAAO,CAAC,iBAAiB;IASzB;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBpH;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;CAiB/G"}
+{"version":3,"file":"module.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/module.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAAqB,MAAM,uBAAuB,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAGpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,oBAAoB,EAAqC,MAAM,wBAAwB,CAAC;AAC7H,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAI7D;;;;GAIG;AACH,qBAAa,iBAAkB,YAAW,kBAAkB,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAC3F,SAAgB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAa;IACpE,OAAO,CAAC,YAAY,CAAC,CAAqB;gBAE9B,YAAY,CAAC,EAAE,kBAAkB;IAI7C;;OAEG;IACH,eAAe,IAAI,kBAAkB,GAAG,SAAS;IAIjD;;;OAGG;IACH,eAAe,IAAI,kBAAkB;IAUrC;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAuC1E;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,YAAY,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAcnL;;OAEG;IACH,iBAAiB,CAChB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,qBAAqB,GAC5B,oBAAoB;IAmBvB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IA8C1B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAuD3B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAwC3B;;OAEG;IACH,OAAO,CAAC,cAAc;IAwBtB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAyB7B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAqB9B,OAAO,CAAC,sBAAsB;IAgB9B;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBpH;;;OAGG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IAWvE;;OAEG;IACG,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,GAAG,OAAO,CAAC,WAAW,CAAC;IA0BrH;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;CAiB/G"}

package/dist/src/vtab/memory/module.js

@@ -1,7 +1,6 @@
 import { QuereusError } from '../../common/errors.js';
 import { StatusCode } from '../../common/types.js';
 import { MemoryTable } from './table.js';
-import { IndexConstraintOp } from '../../common/constants.js';
 import { MemoryTableManager } from './layer/manager.js';
 import { createMemoryTableLoggers } from './utils/logging.js';
 import { AccessPlanBuilder, validateAccessPlan } from '../best-access-plan.js';
@@ -67,7 +66,7 @@ export class MemoryTableModule {
     /**
      * Connects to an existing memory table definition
      */
-    async connect(db, pAux, moduleName, schemaName, tableName, _options, _tableSchema) {
+    async connect(db, pAux, moduleName, schemaName, tableName, options, _tableSchema) {
         const tableKey = `${schemaName}.${tableName}`.toLowerCase();
         const existingManager = this.tables.get(tableKey);
         if (!existingManager) {
@@ -75,15 +74,17 @@ export class MemoryTableModule {
         }
         logger.operation('Connect Table', tableName, { schema: schemaName });
         // Create a new MemoryTable instance connected to the existing manager
-        return new MemoryTable(db, this, existingManager);
+        return new MemoryTable(db, this, existingManager, options._readCommitted);
     }
     /**
      * Modern, type-safe access planning interface
      */
     getBestAccessPlan(db, tableInfo, request) {
         logger.debugLog(`[getBestAccessPlan] Planning access for ${tableInfo.name} with ${request.filters.length} filters`);
-        // Get table size estimate for cost calculations
-        const estimatedTableSize = request.estimatedRows ?? 1000;
+        // Get table size estimate for cost calculations.
+        // The schema defaults estimatedRows to 0 at creation time, so treat 0 as
+        // "unknown" and fall back to a reasonable default to avoid degenerate costs.
+        const estimatedTableSize = request.estimatedRows || 1000;
         // Find the best access strategy
         const bestPlan = this.findBestAccessPlan(tableInfo, request, estimatedTableSize);
         // Validate the plan before returning
@@ -91,22 +92,17 @@ export class MemoryTableModule {
         logger.debugLog(`[getBestAccessPlan] Selected plan: ${bestPlan.explains} (cost: ${bestPlan.cost}, rows: ${bestPlan.rows})`);
         return bestPlan;
     }
-    /**
-     * Build column metadata for access planning
-     */
-    buildColumnMetadata(tableInfo) {
-        return tableInfo.columns.map((col, index) => ({
-            index,
-            name: col.name,
-            type: col.logicalType,
-            isPrimaryKey: tableInfo.primaryKeyDefinition.some(pk => pk.index === index),
-            isUnique: col.primaryKey // Primary key columns are unique, others would be determined by constraints/indexes
-        }));
-    }
     /**
      * Find the best access plan for the given request
      */
     findBestAccessPlan(tableInfo, request, estimatedTableSize) {
+        // NOTE: IS NULL / IS NOT NULL optimization is not yet wired up.
+        // The constraint extractor produces these as unary expressions which
+        // are not currently extracted as PredicateConstraints. When that support
+        // is added, a handleNullConstraints pre-pass should be re-introduced
+        // here — but it must also produce a proper empty-result physical node
+        // (not just rows=0 on a plan lacking indexName/seekColumnIndexes, which
+        // would fall through to SeqScan and return all rows).
         const availableIndexes = this.gatherAvailableIndexes(tableInfo);
         let bestPlan;
         // Try to find an index-based plan
@@ -144,24 +140,36 @@ export class MemoryTableModule {
                 .setHandledFilters(new Array(request.filters.length).fill(false))
                 .build();
         }
-        // Check for equality constraints on index columns
+        // Check for equality constraints on index columns (prefix matching)
         const equalityMatches = this.findEqualityMatches(indexCols, request.filters);
         if (equalityMatches.matchCount === indexCols.length) {
-            // Perfect equality match - index seek
+            // Perfect equality match on all index columns - index seek (or multi-seek for IN)
+            const seekCols = indexCols.slice(0, equalityMatches.matchCount).map(c => c.index);
+            const { inCardinality } = equalityMatches;
+            const isMultiSeek = inCardinality > 1;
             return AccessPlanBuilder
-                .eqMatch(1) // Assuming unique index access
+                .eqMatch(inCardinality)
                 .setHandledFilters(equalityMatches.handledFilters)
-                .setIsSet(true)
-                .setExplanation(`Index seek on ${index.name}`)
+                .setIsSet(!isMultiSeek)
+                .setIndexName(index.name)
+                .setSeekColumns(seekCols)
+                .setExplanation(`Index ${isMultiSeek ? `multi-seek(${inCardinality})` : 'seek'} on ${index.name}`)
                 .build();
         }
+        // NOTE: Prefix-equality + trailing-range on composite indexes is not yet
+        // supported at the physical scan level (partial prefix seek on composite
+        // B-tree keys requires composite range bounds).  Fall through to
+        // range-on-first-column check, which the runtime can execute correctly.
         // Check for range constraints on first index column
         const rangeMatch = this.findRangeMatch(indexCols[0], request.filters);
         if (rangeMatch.hasRange) {
             const estimatedRangeRows = Math.max(1, Math.floor(estimatedTableSize / 4));
+            const seekCols = [indexCols[0].index];
             return AccessPlanBuilder
                 .rangeScan(estimatedRangeRows)
                 .setHandledFilters(rangeMatch.handledFilters)
+                .setIndexName(index.name)
+                .setSeekColumns(seekCols)
                 .setExplanation(`Index range scan on ${index.name}`)
                 .build();
         }
@@ -172,30 +180,42 @@ export class MemoryTableModule {
             .build();
     }
     /**
-     * Find equality matches for index columns
+     * Find equality matches for index columns (prefix matching).
+     * Handles `=`, single-value `IN`, and multi-value `IN` as equality constraints.
+     * Returns the total cardinality (product of IN list sizes) for cost estimation.
      */
     findEqualityMatches(indexCols, filters) {
         const handledFilters = new Array(filters.length).fill(false);
         let matchCount = 0;
+        let inCardinality = 1;
         for (const indexCol of indexCols) {
             let foundMatch = false;
             for (let i = 0; i < filters.length; i++) {
                 const filter = filters[i];
-                if (filter.columnIndex === indexCol.index &&
-                    filter.op === '=' &&
-                    filter.usable &&
-                    filter.value !== undefined) {
+                if (filter.columnIndex !== indexCol.index || !filter.usable)
+                    continue;
+                // Direct equality (value may be undefined for parameter bindings —
+                // the actual value is supplied at runtime via seek key expressions)
+                if (filter.op === '=') {
                     handledFilters[i] = true;
                     foundMatch = true;
                     matchCount++;
                     break;
                 }
+                // IN constraint — treat as equality for prefix matching
+                if (filter.op === 'IN' && Array.isArray(filter.value) && filter.value.length > 0) {
+                    handledFilters[i] = true;
+                    foundMatch = true;
+                    matchCount++;
+                    inCardinality *= filter.value.length;
+                    break;
+                }
             }
             if (!foundMatch) {
                 break; // Can't use remaining index columns
             }
         }
-        return { matchCount, handledFilters };
+        return { matchCount, handledFilters, inCardinality };
     }
     /**
      * Find range match for a column
@@ -206,7 +226,7 @@ export class MemoryTableModule {
         let hasUpper = false;
         for (let i = 0; i < filters.length; i++) {
             const filter = filters[i];
-            if (filter.columnIndex === indexCol.index && filter.usable && filter.value !== undefined) {
+            if (filter.columnIndex === indexCol.index && filter.usable) {
                 if (filter.op === '>' || filter.op === '>=') {
                     handledFilters[i] = true;
                     hasLower = true;
@@ -257,22 +277,6 @@ export class MemoryTableModule {
         }
         return true;
     }
-    createPlanningContext(_tableInfo, _indexInfo) {
-        return {
-            // Plan type constants
-            PLAN_TYPE_FULL_ASC: 0,
-            PLAN_TYPE_FULL_DESC: 1,
-            PLAN_TYPE_EQ: 2,
-            PLAN_TYPE_RANGE_ASC: 3,
-            PLAN_TYPE_RANGE_DESC: 4,
-            // Utility functions
-            encodeIdxNum: (indexId, planType) => {
-                return (indexId << 3) | planType;
-            },
-            // Table size estimate for costing
-            tableSize: 1000,
-        };
-    }
     gatherAvailableIndexes(tableInfo) {
         const availableIndexes = [];
         // Add pseudo-index for primary key
@@ -285,244 +289,6 @@ export class MemoryTableModule {
         availableIndexes.push(...(tableInfo.indexes ?? []));
         return availableIndexes;
     }
-    findBestPlan(context, availableIndexes, indexInfo) {
-        let bestPlan = this.createInitialPlan(context);
-        for (const [indexId, index] of availableIndexes.entries()) {
-            const indexPlan = this.evaluateIndexPlan(context, index, indexId, indexInfo);
-            if (indexPlan.cost < bestPlan.cost) {
-                bestPlan = indexPlan;
-            }
-        }
-        return this.ensureFallbackPlan(bestPlan, context, availableIndexes);
-    }
-    createInitialPlan(context) {
-        return {
-            indexId: -1,
-            planType: context.PLAN_TYPE_FULL_ASC,
-            cost: context.tableSize * 10.0,
-            rows: BigInt(context.tableSize),
-            usedConstraintIndices: new Set(),
-            orderByConsumed: false,
-            isDesc: false,
-        };
-    }
-    evaluateIndexPlan(context, index, indexId, indexInfo) {
-        let currentPlan = this.createInitialPlan(context);
-        currentPlan.indexId = indexId;
-        // Evaluate equality plan
-        const equalityPlan = this.evaluateEqualityPlan(context, index, indexId, indexInfo);
-        if (equalityPlan && equalityPlan.cost < currentPlan.cost) {
-            currentPlan = equalityPlan;
-        }
-        // Evaluate range plan
-        const rangePlan = this.evaluateRangePlan(context, index, indexId, indexInfo, currentPlan);
-        if (rangePlan && rangePlan.cost < currentPlan.cost) {
-            currentPlan = rangePlan;
-        }
-        // Check ORDER BY consumption
-        const orderOptimizedPlan = this.evaluateOrderByConsumption(context, index, indexInfo, currentPlan);
-        if (orderOptimizedPlan) {
-            currentPlan = orderOptimizedPlan;
-        }
-        return currentPlan;
-    }
-    evaluateEqualityPlan(context, index, indexId, indexInfo) {
-        const indexCols = index.columns;
-        const eqConstraints = this.findEqualityConstraints(indexCols, indexInfo);
-        if (!this.canUseEqualityPlan(indexCols, eqConstraints)) {
-            logger.debugLog(`[xBestIndex] Cannot use EQ plan for index ${index.name} - missing constraints`);
-            return null;
-        }
-        const planEqCost = Math.log2(context.tableSize + 1) + 1.0;
-        const planEqRows = BigInt(1);
-        logger.debugLog(`[xBestIndex] EQ Plan viable for index ${index.name}. Cost: ${planEqCost}`);
-        return {
-            indexId: indexId,
-            planType: context.PLAN_TYPE_EQ,
-            cost: planEqCost,
-            rows: planEqRows,
-            usedConstraintIndices: new Set(eqConstraints.values()),
-            orderByConsumed: true,
-            isDesc: false
-        };
-    }
-    findEqualityConstraints(indexCols, indexInfo) {
-        const eqConstraints = new Map();
-        for (const [k, indexCol] of indexCols.entries()) {
-            const colIndex = indexCol.index;
-            let foundConstraint = false;
-            for (let i = 0; i < indexInfo.nConstraint; i++) {
-                const constraint = indexInfo.aConstraint[i];
-                if (constraint.iColumn === colIndex &&
-                    constraint.op === IndexConstraintOp.EQ &&
-                    constraint.usable) {
-                    eqConstraints.set(colIndex, i);
-                    foundConstraint = true;
-                    logger.debugLog(`[xBestIndex] Found EQ constraint ${i} for column ${colIndex}`);
-                    break;
-                }
-            }
-            if (!foundConstraint) {
-                logger.debugLog(`[xBestIndex] No EQ constraint for index column ${k} (schema idx ${colIndex})`);
-                return new Map(); // Can't use equality plan without all columns
-            }
-        }
-        return eqConstraints;
-    }
-    canUseEqualityPlan(indexCols, eqConstraints) {
-        return indexCols.length > 0 && eqConstraints.size === indexCols.length;
-    }
-    evaluateRangePlan(context, index, indexId, indexInfo, currentPlan) {
-        const indexCols = index.columns;
-        const firstIndexColIdx = indexCols[0]?.index ?? -2;
-        const rangeBounds = this.findRangeBounds(firstIndexColIdx, indexInfo);
-        if (!rangeBounds.lowerBound && !rangeBounds.upperBound) {
-            return null;
-        }
-        const planRangeRows = BigInt(Math.max(1, Math.floor(context.tableSize / 4)));
-        const planRangeCost = Math.log2(context.tableSize + 1) * 2.0 + Number(planRangeRows);
-        if (planRangeCost >= currentPlan.cost) {
-            return null;
-        }
-        const usedIndices = new Set();
-        if (rangeBounds.lowerBound)
-            usedIndices.add(rangeBounds.lowerBound.index);
-        if (rangeBounds.upperBound)
-            usedIndices.add(rangeBounds.upperBound.index);
-        return {
-            ...currentPlan,
-            planType: context.PLAN_TYPE_RANGE_ASC,
-            cost: planRangeCost,
-            rows: planRangeRows,
-            usedConstraintIndices: usedIndices,
-            orderByConsumed: false
-        };
-    }
-    findRangeBounds(firstColIndex, indexInfo) {
-        let lowerBound = null;
-        let upperBound = null;
-        for (let i = 0; i < indexInfo.nConstraint; i++) {
-            const constraint = indexInfo.aConstraint[i];
-            if (constraint.iColumn === firstColIndex && constraint.usable) {
-                if (constraint.op === IndexConstraintOp.GT || constraint.op === IndexConstraintOp.GE) {
-                    if (!lowerBound || constraint.op > lowerBound.op) {
-                        lowerBound = { index: i, op: constraint.op };
-                    }
-                }
-                else if (constraint.op === IndexConstraintOp.LT || constraint.op === IndexConstraintOp.LE) {
-                    if (!upperBound || constraint.op < upperBound.op) {
-                        upperBound = { index: i, op: constraint.op };
-                    }
-                }
-            }
-        }
-        return { lowerBound, upperBound };
-    }
-    evaluateOrderByConsumption(context, index, indexInfo, currentPlan) {
-        if (indexInfo.nOrderBy === 0) {
-            return null;
-        }
-        const indexCols = index.columns;
-        const orderByConsumption = this.checkOrderByConsumption(indexCols, indexInfo);
-        if (!orderByConsumption.canConsume) {
-            return null;
-        }
-        const indexScanIsDesc = indexCols[0]?.desc ?? false;
-        const requiresDescScan = orderByConsumption.isDesc !== indexScanIsDesc;
-        const basePlanType = currentPlan.planType;
-        if (basePlanType === context.PLAN_TYPE_FULL_ASC || basePlanType === context.PLAN_TYPE_RANGE_ASC) {
-            return {
-                ...currentPlan,
-                orderByConsumed: true,
-                isDesc: orderByConsumption.isDesc,
-                planType: this.adjustPlanTypeForOrder(context, basePlanType, requiresDescScan),
-                cost: currentPlan.cost * 0.9 // Prefer consuming order
-            };
-        }
-        return null;
-    }
-    checkOrderByConsumption(indexCols, indexInfo) {
-        if (indexInfo.nOrderBy === 0 || indexCols.length < indexInfo.nOrderBy) {
-            return { canConsume: false, isDesc: false };
-        }
-        const isOrderDesc = indexInfo.aOrderBy[0].desc;
-        for (let k = 0; k < indexInfo.nOrderBy; k++) {
-            const orderByCol = indexInfo.aOrderBy[k];
-            const indexCol = indexCols[k];
-            if (orderByCol.iColumn !== indexCol.index || orderByCol.desc !== isOrderDesc) {
-                return { canConsume: false, isDesc: false };
-            }
-        }
-        return { canConsume: true, isDesc: isOrderDesc };
-    }
-    adjustPlanTypeForOrder(context, basePlanType, requiresDescScan) {
-        if (basePlanType === context.PLAN_TYPE_FULL_ASC) {
-            return requiresDescScan ? context.PLAN_TYPE_FULL_DESC : context.PLAN_TYPE_FULL_ASC;
-        }
-        else { // RANGE_ASC
-            return requiresDescScan ? context.PLAN_TYPE_RANGE_DESC : context.PLAN_TYPE_RANGE_ASC;
-        }
-    }
-    ensureFallbackPlan(bestPlan, context, availableIndexes) {
-        if (bestPlan.indexId === -1) {
-            const primaryIndex = availableIndexes.findIndex(idx => idx.name === '_primary_');
-            bestPlan.indexId = primaryIndex >= 0 ? primaryIndex : 0;
-            bestPlan.planType = context.PLAN_TYPE_FULL_ASC;
-            bestPlan.cost = context.tableSize * 10.0;
-            bestPlan.rows = BigInt(context.tableSize);
-            bestPlan.usedConstraintIndices.clear();
-            bestPlan.orderByConsumed = false;
-        }
-        return bestPlan;
-    }
-    populateIndexInfoOutput(indexInfo, bestPlan, availableIndexes) {
-        const context = this.createPlanningContext({}, indexInfo);
-        indexInfo.idxNum = context.encodeIdxNum(bestPlan.indexId, bestPlan.planType);
-        indexInfo.estimatedCost = bestPlan.cost;
-        indexInfo.estimatedRows = bestPlan.rows;
-        indexInfo.orderByConsumed = bestPlan.orderByConsumed;
-        indexInfo.idxFlags = (bestPlan.planType === context.PLAN_TYPE_EQ) ? 1 : 0;
-        this.buildConstraintUsage(indexInfo, bestPlan);
-        this.buildIndexString(indexInfo, bestPlan, availableIndexes);
-    }
-    buildConstraintUsage(indexInfo, bestPlan) {
-        const constraintUsage = Array.from({ length: indexInfo.nConstraint }, () => ({
-            argvIndex: 0,
-            omit: false
-        }));
-        let currentArg = 1;
-        bestPlan.usedConstraintIndices.forEach((constraintIndex) => {
-            constraintUsage[constraintIndex].argvIndex = currentArg++;
-            constraintUsage[constraintIndex].omit = (bestPlan.planType === 2); // PLAN_TYPE_EQ
-        });
-        indexInfo.aConstraintUsage = constraintUsage;
-    }
-    buildIndexString(indexInfo, bestPlan, availableIndexes) {
-        const chosenIndex = availableIndexes[bestPlan.indexId];
-        const idxStrParts = [
-            `idx=${chosenIndex?.name ?? 'unknown'}(${bestPlan.indexId})`,
-            `plan=${bestPlan.planType}`
-        ];
-        if (bestPlan.orderByConsumed) {
-            idxStrParts.push(`ordCons=${bestPlan.isDesc ? 'DESC' : 'ASC'}`);
-        }
-        if (bestPlan.usedConstraintIndices.size > 0) {
-            const argvMapping = this.createArgvMapping(indexInfo.aConstraintUsage);
-            if (argvMapping.length > 0) {
-                idxStrParts.push(`argvMap=[${argvMapping.join(',')}]`);
-            }
-        }
-        indexInfo.idxStr = idxStrParts.join(';');
-    }
-    createArgvMapping(constraintUsage) {
-        return constraintUsage
-            .map((usage, constraintIdx) => ({
-            argIdx: usage.argvIndex,
-            constraintIdx
-        }))
-            .filter(item => item.argIdx > 0)
-            .map(item => `[${item.argIdx},${item.constraintIdx}]`);
-    }
     /**
      * Destroys a memory table and frees associated resources
      */
@@ -543,6 +309,45 @@ export class MemoryTableModule {
             logger.operation('Destroy Table', tableName, { schema: schemaName });
         }
     }
+    /**
+     * Renames a memory table's internal registration key.
+     * Called by the ALTER TABLE RENAME TO emitter after schema update.
+     */
+    renameTable(schemaName, oldName, newName) {
+        const oldKey = `${schemaName}.${oldName}`.toLowerCase();
+        const newKey = `${schemaName}.${newName}`.toLowerCase();
+        const manager = this.tables.get(oldKey);
+        if (manager) {
+            manager.renameTable(newName);
+            this.tables.delete(oldKey);
+            this.tables.set(newKey, manager);
+        }
+    }
+    /**
+     * Alters an existing memory table's structure (ADD/DROP/RENAME COLUMN).
+     */
+    async alterTable(db, schemaName, tableName, change) {
+        const tableKey = `${schemaName}.${tableName}`.toLowerCase();
+        const manager = this.tables.get(tableKey);
+        if (!manager) {
+            throw new QuereusError(`Memory table '${tableName}' not found in schema '${schemaName}'. Cannot alter.`, StatusCode.ERROR);
+        }
+        switch (change.type) {
+            case 'addColumn':
+                await manager.addColumn(change.columnDef);
+                break;
+            case 'dropColumn':
+                await manager.dropColumn(change.columnName);
+                break;
+            case 'renameColumn':
+                if (!change.newColumnDefAst) {
+                    throw new QuereusError('RENAME COLUMN requires a new column definition AST', StatusCode.INTERNAL);
+                }
+                await manager.renameColumn(change.oldName, change.newColumnDefAst);
+                break;
+        }
+        return manager.tableSchema;
+    }
     /**
      * Creates an index on a memory table
      */