@nahisaho/yata-scale 1.8.5

package/dist/query/QueryPlanner.js

@@ -0,0 +1,235 @@
+/**
+ * @nahisaho/yata-scale - Query Planner
+ *
+ * Generates optimized query execution plans
+ */
+/**
+ * Query planner for generating execution plans
+ */
+export class QueryPlanner {
+    indexStats = new Map();
+    constructor() { }
+    /**
+     * Register index statistics
+     */
+    registerIndex(stats) {
+        this.indexStats.set(stats.name, stats);
+    }
+    /**
+     * Unregister index
+     */
+    unregisterIndex(name) {
+        this.indexStats.delete(name);
+    }
+    /**
+     * Generate query plan
+     */
+    plan(query) {
+        const steps = [];
+        let stepId = 0;
+        // Determine best access method
+        const accessStep = this.planAccessPath(query, stepId++);
+        steps.push(accessStep);
+        // Add filter step if needed
+        if (query.filters && query.filters.length > 0) {
+            for (const filter of query.filters) {
+                const filterStep = this.planFilterStep(filter, stepId++, [accessStep.id]);
+                steps.push(filterStep);
+            }
+        }
+        // Add traversal steps for graph queries
+        if (query.traversal) {
+            const traversalStep = this.planTraversalStep(query, stepId++, steps);
+            steps.push(traversalStep);
+        }
+        // Add sort step if needed
+        if (query.orderBy) {
+            const lastStep = steps[steps.length - 1];
+            const sortStep = this.planSortStep(query, stepId++, [lastStep.id]);
+            steps.push(sortStep);
+        }
+        // Add limit step if needed
+        if (query.limit !== undefined) {
+            const lastStep = steps[steps.length - 1];
+            const limitStep = this.planLimitStep(query, stepId++, [lastStep.id]);
+            steps.push(limitStep);
+        }
+        // Calculate total cost
+        const totalCost = steps.reduce((sum, step) => sum + step.estimatedCost, 0);
+        return {
+            query,
+            steps: steps.map((s) => ({
+                type: s.type,
+                target: s.target,
+                index: s.index,
+                filter: s.filter,
+                estimatedCost: s.estimatedCost,
+            })),
+            estimatedCost: totalCost,
+            parallelizable: this.isParallelizable(steps),
+            targetShards: this.determineTargetShards(query),
+        };
+    }
+    /**
+     * Plan access path (scan vs index)
+     */
+    planAccessPath(query, id) {
+        // Check if we can use an index
+        const bestIndex = this.findBestIndex(query);
+        if (bestIndex) {
+            return {
+                id: `step_${id}`,
+                type: 'index',
+                target: query.entityTypes?.[0] ?? 'entity',
+                index: bestIndex.name,
+                dependencies: [],
+                estimatedCost: Math.log2(bestIndex.entryCount + 1) * 10,
+                estimatedRows: bestIndex.entryCount * bestIndex.selectivity,
+            };
+        }
+        // Fall back to scan
+        return {
+            id: `step_${id}`,
+            type: 'scan',
+            target: query.entityTypes?.[0] ?? 'entity',
+            dependencies: [],
+            estimatedCost: 1000, // Full scan is expensive
+            estimatedRows: 10000, // Assume moderate result set
+        };
+    }
+    /**
+     * Find best index for query
+     */
+    findBestIndex(query) {
+        if (!query.filters || query.filters.length === 0) {
+            return null;
+        }
+        let bestIndex = null;
+        let bestSelectivity = 1;
+        for (const filter of query.filters) {
+            // Look for index on filter field
+            const indexName = `idx_${filter.field}`;
+            const stats = this.indexStats.get(indexName);
+            if (stats && stats.selectivity < bestSelectivity) {
+                bestIndex = stats;
+                bestSelectivity = stats.selectivity;
+            }
+        }
+        return bestIndex;
+    }
+    /**
+     * Plan filter step
+     */
+    planFilterStep(filter, id, dependencies) {
+        return {
+            id: `step_${id}`,
+            type: 'filter',
+            filter,
+            dependencies,
+            estimatedCost: 1, // Filter is cheap per row
+            estimatedRows: 0, // Depends on previous step
+        };
+    }
+    /**
+     * Plan traversal step
+     */
+    planTraversalStep(query, id, previousSteps) {
+        const lastStep = previousSteps[previousSteps.length - 1];
+        const depth = query.traversal?.maxDepth ?? 1;
+        return {
+            id: `step_${id}`,
+            type: 'join',
+            target: 'relationship',
+            dependencies: [lastStep.id],
+            estimatedCost: depth * 100, // Cost increases with depth
+            estimatedRows: lastStep.estimatedRows * Math.pow(5, depth), // Assume 5 avg neighbors
+        };
+    }
+    /**
+     * Plan sort step
+     */
+    planSortStep(query, id, dependencies) {
+        return {
+            id: `step_${id}`,
+            type: 'sort',
+            target: query.orderBy,
+            dependencies,
+            estimatedCost: 50, // Sorting is moderately expensive
+            estimatedRows: 0, // Same as input
+        };
+    }
+    /**
+     * Plan limit step
+     */
+    planLimitStep(query, id, dependencies) {
+        return {
+            id: `step_${id}`,
+            type: 'limit',
+            dependencies,
+            estimatedCost: 1, // Limit is very cheap
+            estimatedRows: query.limit ?? 100,
+        };
+    }
+    /**
+     * Check if plan is parallelizable
+     */
+    isParallelizable(steps) {
+        // Can parallelize if first step is scan or index lookup
+        const firstStep = steps[0];
+        return firstStep.type === 'scan' || firstStep.type === 'index';
+    }
+    /**
+     * Determine target shards for query
+     */
+    determineTargetShards(query) {
+        // If query has specific IDs, can route to specific shards
+        if (query.startEntityIds && query.startEntityIds.length > 0) {
+            // Would use shard router to determine shards
+            return ['shard_determined_by_router'];
+        }
+        // Otherwise, query all shards
+        return ['all'];
+    }
+    /**
+     * Optimize plan
+     */
+    optimize(plan) {
+        // Simple optimization: push down filters
+        const optimizedSteps = [...plan.steps];
+        // Reorder to put cheaper operations first
+        optimizedSteps.sort((a, b) => a.estimatedCost - b.estimatedCost);
+        return {
+            ...plan,
+            steps: optimizedSteps,
+        };
+    }
+    /**
+     * Explain plan in human-readable format
+     */
+    explain(plan) {
+        const lines = [];
+        lines.push('Query Execution Plan');
+        lines.push('====================');
+        lines.push(`Estimated Total Cost: ${plan.estimatedCost.toFixed(2)}`);
+        lines.push(`Parallelizable: ${plan.parallelizable}`);
+        lines.push(`Target Shards: ${plan.targetShards.join(', ')}`);
+        lines.push('');
+        lines.push('Steps:');
+        for (let i = 0; i < plan.steps.length; i++) {
+            const step = plan.steps[i];
+            lines.push(`  ${i + 1}. ${step.type.toUpperCase()}`);
+            if (step.target) {
+                lines.push(`     Target: ${step.target}`);
+            }
+            if (step.index) {
+                lines.push(`     Index: ${step.index}`);
+            }
+            if (step.filter) {
+                lines.push(`     Filter: ${step.filter.field} ${step.filter.operator} ${step.filter.value}`);
+            }
+            lines.push(`     Estimated Cost: ${step.estimatedCost.toFixed(2)}`);
+        }
+        return lines.join('\n');
+    }
+}
+//# sourceMappingURL=QueryPlanner.js.map

package/dist/query/QueryPlanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryPlanner.js","sourceRoot":"","sources":["../../src/query/QueryPlanner.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAiCH;;GAEG;AACH,MAAM,OAAO,YAAY;IACf,UAAU,GAAiC,IAAI,GAAG,EAAE,CAAC;IAE7D,gBAAe,CAAC;IAEhB;;OAEG;IACH,aAAa,CAAC,KAAsB;QAClC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,IAAY;QAC1B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAiB;QACpB,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,+BAA+B;QAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACxD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEvB,4BAA4B;QAC5B,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1E,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,CAAC;YACrE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC5B,CAAC;QAED,0BAA0B;QAC1B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,CAAC;QAED,2BAA2B;QAC3B,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YACrE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,CAAC;QAED,uBAAuB;QACvB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAE3E,OAAO;YACL,KAAK;YACL,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,aAAa,EAAE,CAAC,CAAC,aAAa;aAC/B,CAAC,CAAC;YACH,aAAa,EAAE,SAAS;YACxB,cAAc,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;YAC5C,YAAY,EAAE,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC;SAChD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAiB,EAAE,EAAU;QAClD,+BAA+B;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAE5C,IAAI,SAAS,EAAE,CAAC;YACd,OAAO;gBACL,EAAE,EAAE,QAAQ,EAAE,EAAE;gBAChB,IAAI,EAAE,OAAO;gBACb,MAAM,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ;gBAC1C,KAAK,EAAE,SAAS,CAAC,IAAI;gBACrB,YAAY,EAAE,EAAE;gBAChB,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,EAAE;gBACvD,aAAa,EAAE,SAAS,CAAC,UAAU,GAAG,SAAS,CAAC,WAAW;aAC5D,CAAC;QACJ,CAAC;QAED,oBAAoB;QACpB,OAAO;YACL,EAAE,EAAE,QAAQ,EAAE,EAAE;YAChB,IAAI,EAAE,MAAM;YACZ,MAAM,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ;YAC1C,YAAY,EAAE,EAAE;YAChB,aAAa,EAAE,IAAI,EAAE,yBAAyB;YAC9C,aAAa,EAAE,KAAK,EAAE,6BAA6B;SACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,KAAiB;QACrC,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,SAAS,GAA2B,IAAI,CAAC;QAC7C,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,iCAAiC;YACjC,MAAM,SAAS,GAAG,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAE7C,IAAI,KAAK,IAAI,KAAK,CAAC,WAAW,GAAG,eAAe,EAAE,CAAC;gBACjD,SAAS,GAAG,KAAK,CAAC;gBAClB,eAAe,GAAG,KAAK,CAAC,WAAW,CAAC;YACtC,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,MAAmB,EACnB,EAAU,EACV,YAAsB;QAEtB,OAAO;YACL,EAAE,EAAE,QAAQ,EAAE,EAAE;YAChB,IAAI,EAAE,QAAQ;YACd,MAAM;YACN,YAAY;YACZ,aAAa,EAAE,CAAC,EAAE,0BAA0B;YAC5C,aAAa,EAAE,CAAC,EAAE,2BAA2B;SAC9C,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CACvB,KAAiB,EACjB,EAAU,EACV,aAAyB;QAEzB,MAAM,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,QAAQ,IAAI,CAAC,CAAC;QAE7C,OAAO;YACL,EAAE,EAAE,QAAQ,EAAE,EAAE;YAChB,IAAI,EAAE,MAAM;YACZ,MAAM,EAAE,cAAc;YACtB,YAAY,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3B,aAAa,EAAE,KAAK,GAAG,GAAG,EAAE,4BAA4B;YACxD,aAAa,EAAE,QAAQ,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,yBAAyB;SACtF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,KAAiB,EACjB,EAAU,EACV,YAAsB;QAEtB,OAAO;YACL,EAAE,EAAE,QAAQ,EAAE,EAAE;YAChB,IAAI,EAAE,MAAM;YACZ,MAAM,EAAE,KAAK,CAAC,OAAO;YACrB,YAAY;YACZ,aAAa,EAAE,EAAE,EAAE,kCAAkC;YACrD,aAAa,EAAE,CAAC,EAAE,gBAAgB;SACnC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,KAAiB,EACjB,EAAU,EACV,YAAsB;QAEtB,OAAO;YACL,EAAE,EAAE,QAAQ,EAAE,EAAE;YAChB,IAAI,EAAE,OAAO;YACb,YAAY;YACZ,aAAa,EAAE,CAAC,EAAE,sBAAsB;YACxC,aAAa,EAAE,KAAK,CAAC,KAAK,IAAI,GAAG;SAClC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAiB;QACxC,wDAAwD;QACxD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC,IAAI,KAAK,MAAM,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,CAAC;IACjE,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,KAAiB;QAC7C,0DAA0D;QAC1D,IAAI,KAAK,CAAC,cAAc,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,6CAA6C;YAC7C,OAAO,CAAC,4BAA4B,CAAC,CAAC;QACxC,CAAC;QAED,8BAA8B;QAC9B,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAe;QACtB,yCAAyC;QACzC,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAEvC,0CAA0C;QAC1C,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;QAEjE,OAAO;YACL,GAAG,IAAI;YACP,KAAK,EAAE,cAAc;SACtB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAe;QACrB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,yBAAyB,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrE,KAAK,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5C,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1C,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/F,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,wBAAwB,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF"}

package/dist/query/WorkerPool.d.ts

@@ -0,0 +1,108 @@
+/**
+ * @nahisaho/yata-scale - Worker Pool
+ *
+ * Manages worker threads for parallel query execution
+ */
+/**
+ * Task to execute
+ */
+export interface WorkerTask<T, R> {
+    readonly id: string;
+    readonly data: T;
+    readonly execute: (data: T) => Promise<R>;
+}
+/**
+ * Task result
+ */
+export interface TaskResult<R> {
+    readonly taskId: string;
+    readonly result?: R;
+    readonly error?: Error;
+    readonly durationMs: number;
+}
+/**
+ * Worker pool statistics
+ */
+export interface WorkerPoolStats {
+    readonly poolSize: number;
+    readonly activeTasks: number;
+    readonly queuedTasks: number;
+    readonly completedTasks: number;
+    readonly failedTasks: number;
+    readonly avgDurationMs: number;
+}
+/**
+ * Worker pool for parallel task execution
+ * Note: In Node.js, this would use worker_threads
+ * This is a simplified async implementation
+ */
+export declare class WorkerPool {
+    private readonly poolSize;
+    private activeTasks;
+    private queuedTasks;
+    private completedTasks;
+    private failedTasks;
+    private totalDuration;
+    constructor(poolSize?: number);
+    /**
+     * Submit a task for execution
+     */
+    submit<T, R>(task: WorkerTask<T, R>): Promise<TaskResult<R>>;
+    /**
+     * Execute a task
+     */
+    private executeTask;
+    /**
+     * Process queued tasks
+     */
+    private processQueue;
+    /**
+     * Submit multiple tasks and wait for all
+     */
+    submitAll<T, R>(tasks: WorkerTask<T, R>[]): Promise<TaskResult<R>[]>;
+    /**
+     * Submit multiple tasks and get first result
+     */
+    submitRace<T, R>(tasks: WorkerTask<T, R>[]): Promise<TaskResult<R>>;
+    /**
+     * Map operation over data with parallelism
+     */
+    map<T, R>(items: T[], fn: (item: T) => Promise<R>, taskIdPrefix?: string): Promise<R[]>;
+    /**
+     * Filter operation with parallelism
+     */
+    filter<T>(items: T[], predicate: (item: T) => Promise<boolean>, taskIdPrefix?: string): Promise<T[]>;
+    /**
+     * Reduce operation (sequential with parallel mapping)
+     */
+    reduce<T, R>(items: T[], fn: (acc: R, item: T) => Promise<R>, initial: R): Promise<R>;
+    /**
+     * Get pool statistics
+     */
+    getStats(): WorkerPoolStats;
+    /**
+     * Wait for all active tasks to complete
+     */
+    drain(): Promise<void>;
+    /**
+     * Clear queued tasks
+     */
+    clear(): void;
+    /**
+     * Shutdown the pool
+     */
+    shutdown(): Promise<void>;
+    /**
+     * Get active task count
+     */
+    get activeCount(): number;
+    /**
+     * Get queued task count
+     */
+    get queuedCount(): number;
+    /**
+     * Check if pool is idle
+     */
+    get isIdle(): boolean;
+}
+//# sourceMappingURL=WorkerPool.d.ts.map

package/dist/query/WorkerPool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"WorkerPool.d.ts","sourceRoot":"","sources":["../../src/query/WorkerPool.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,EAAE,CAAC;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACjB,QAAQ,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;CAC3C;AAED;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpB,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED;;;;GAIG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,WAAW,CAAa;IAChC,OAAO,CAAC,WAAW,CAAwF;IAC3G,OAAO,CAAC,cAAc,CAAa;IACnC,OAAO,CAAC,WAAW,CAAa;IAChC,OAAO,CAAC,aAAa,CAAa;gBAEtB,QAAQ,GAAE,MAAU;IAIhC;;OAEG;IACG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAclE;;OAEG;YACW,WAAW;IAsCzB;;OAEG;IACH,OAAO,CAAC,YAAY;IAOpB;;OAEG;IACG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;IAK1E;;OAEG;IACG,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAKzE;;OAEG;IACG,GAAG,CAAC,CAAC,EAAE,CAAC,EACZ,KAAK,EAAE,CAAC,EAAE,EACV,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAC3B,YAAY,GAAE,MAAc,GAC3B,OAAO,CAAC,CAAC,EAAE,CAAC;IAqBf;;OAEG;IACG,MAAM,CAAC,CAAC,EACZ,KAAK,EAAE,CAAC,EAAE,EACV,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,EACxC,YAAY,GAAE,MAAiB,GAC9B,OAAO,CAAC,CAAC,EAAE,CAAC;IAmBf;;OAEG;IACG,MAAM,CAAC,CAAC,EAAE,CAAC,EACf,KAAK,EAAE,CAAC,EAAE,EACV,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EACnC,OAAO,EAAE,CAAC,GACT,OAAO,CAAC,CAAC,CAAC;IAQb;;OAEG;IACH,QAAQ,IAAI,eAAe;IAY3B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAM5B;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAK/B;;OAEG;IACH,IAAI,WAAW,IAAI,MAAM,CAExB;IAED;;OAEG;IACH,IAAI,WAAW,IAAI,MAAM,CAExB;IAED;;OAEG;IACH,IAAI,MAAM,IAAI,OAAO,CAEpB;CACF"}

package/dist/query/WorkerPool.js

@@ -0,0 +1,195 @@
+/**
+ * @nahisaho/yata-scale - Worker Pool
+ *
+ * Manages worker threads for parallel query execution
+ */
+/**
+ * Worker pool for parallel task execution
+ * Note: In Node.js, this would use worker_threads
+ * This is a simplified async implementation
+ */
+export class WorkerPool {
+    poolSize;
+    activeTasks = 0;
+    queuedTasks = [];
+    completedTasks = 0;
+    failedTasks = 0;
+    totalDuration = 0;
+    constructor(poolSize = 4) {
+        this.poolSize = poolSize;
+    }
+    /**
+     * Submit a task for execution
+     */
+    async submit(task) {
+        if (this.activeTasks < this.poolSize) {
+            return this.executeTask(task);
+        }
+        // Queue the task
+        return new Promise((resolve) => {
+            this.queuedTasks.push({
+                resolve: resolve,
+                task: task,
+            });
+        });
+    }
+    /**
+     * Execute a task
+     */
+    async executeTask(task) {
+        this.activeTasks++;
+        const startTime = Date.now();
+        try {
+            const result = await task.execute(task.data);
+            const durationMs = Date.now() - startTime;
+            this.completedTasks++;
+            this.totalDuration += durationMs;
+            this.activeTasks--;
+            // Process next queued task
+            this.processQueue();
+            return {
+                taskId: task.id,
+                result,
+                durationMs,
+            };
+        }
+        catch (error) {
+            const durationMs = Date.now() - startTime;
+            this.failedTasks++;
+            this.totalDuration += durationMs;
+            this.activeTasks--;
+            // Process next queued task
+            this.processQueue();
+            return {
+                taskId: task.id,
+                error: error instanceof Error ? error : new Error(String(error)),
+                durationMs,
+            };
+        }
+    }
+    /**
+     * Process queued tasks
+     */
+    processQueue() {
+        while (this.activeTasks < this.poolSize && this.queuedTasks.length > 0) {
+            const queued = this.queuedTasks.shift();
+            this.executeTask(queued.task).then(queued.resolve);
+        }
+    }
+    /**
+     * Submit multiple tasks and wait for all
+     */
+    async submitAll(tasks) {
+        const promises = tasks.map((task) => this.submit(task));
+        return Promise.all(promises);
+    }
+    /**
+     * Submit multiple tasks and get first result
+     */
+    async submitRace(tasks) {
+        const promises = tasks.map((task) => this.submit(task));
+        return Promise.race(promises);
+    }
+    /**
+     * Map operation over data with parallelism
+     */
+    async map(items, fn, taskIdPrefix = 'map') {
+        const tasks = items.map((item, i) => ({
+            id: `${taskIdPrefix}_${i}`,
+            data: item,
+            execute: fn,
+        }));
+        const results = await this.submitAll(tasks);
+        // Preserve order and handle errors
+        const output = [];
+        for (const result of results) {
+            if (result.error) {
+                throw result.error;
+            }
+            output.push(result.result);
+        }
+        return output;
+    }
+    /**
+     * Filter operation with parallelism
+     */
+    async filter(items, predicate, taskIdPrefix = 'filter') {
+        const tasks = items.map((item, i) => ({
+            id: `${taskIdPrefix}_${i}`,
+            data: item,
+            execute: predicate,
+        }));
+        const results = await this.submitAll(tasks);
+        const output = [];
+        for (let i = 0; i < results.length; i++) {
+            if (results[i].result) {
+                output.push(items[i]);
+            }
+        }
+        return output;
+    }
+    /**
+     * Reduce operation (sequential with parallel mapping)
+     */
+    async reduce(items, fn, initial) {
+        let result = initial;
+        for (const item of items) {
+            result = await fn(result, item);
+        }
+        return result;
+    }
+    /**
+     * Get pool statistics
+     */
+    getStats() {
+        const totalTasks = this.completedTasks + this.failedTasks;
+        return {
+            poolSize: this.poolSize,
+            activeTasks: this.activeTasks,
+            queuedTasks: this.queuedTasks.length,
+            completedTasks: this.completedTasks,
+            failedTasks: this.failedTasks,
+            avgDurationMs: totalTasks > 0 ? this.totalDuration / totalTasks : 0,
+        };
+    }
+    /**
+     * Wait for all active tasks to complete
+     */
+    async drain() {
+        while (this.activeTasks > 0 || this.queuedTasks.length > 0) {
+            await new Promise((resolve) => setTimeout(resolve, 10));
+        }
+    }
+    /**
+     * Clear queued tasks
+     */
+    clear() {
+        this.queuedTasks = [];
+    }
+    /**
+     * Shutdown the pool
+     */
+    async shutdown() {
+        await this.drain();
+        this.clear();
+    }
+    /**
+     * Get active task count
+     */
+    get activeCount() {
+        return this.activeTasks;
+    }
+    /**
+     * Get queued task count
+     */
+    get queuedCount() {
+        return this.queuedTasks.length;
+    }
+    /**
+     * Check if pool is idle
+     */
+    get isIdle() {
+        return this.activeTasks === 0 && this.queuedTasks.length === 0;
+    }
+}
+//# sourceMappingURL=WorkerPool.js.map

package/dist/query/WorkerPool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WorkerPool.js","sourceRoot":"","sources":["../../src/query/WorkerPool.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAiCH;;;;GAIG;AACH,MAAM,OAAO,UAAU;IACJ,QAAQ,CAAS;IAC1B,WAAW,GAAW,CAAC,CAAC;IACxB,WAAW,GAAqF,EAAE,CAAC;IACnG,cAAc,GAAW,CAAC,CAAC;IAC3B,WAAW,GAAW,CAAC,CAAC;IACxB,aAAa,GAAW,CAAC,CAAC;IAElC,YAAY,WAAmB,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAO,IAAsB;QACvC,IAAI,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QAED,iBAAiB;QACjB,OAAO,IAAI,OAAO,CAAgB,CAAC,OAAO,EAAE,EAAE;YAC5C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBACpB,OAAO,EAAE,OAAmC;gBAC5C,IAAI,EAAE,IAAoC;aAC3C,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW,CAAO,IAAsB;QACpD,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAE1C,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,CAAC,aAAa,IAAI,UAAU,CAAC;YACjC,IAAI,CAAC,WAAW,EAAE,CAAC;YAEnB,2BAA2B;YAC3B,IAAI,CAAC,YAAY,EAAE,CAAC;YAEpB,OAAO;gBACL,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,MAAM;gBACN,UAAU;aACX,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAE1C,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,aAAa,IAAI,UAAU,CAAC;YACjC,IAAI,CAAC,WAAW,EAAE,CAAC;YAEnB,2BAA2B;YAC3B,IAAI,CAAC,YAAY,EAAE,CAAC;YAEpB,OAAO;gBACL,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChE,UAAU;aACX,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAG,CAAC;YACzC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAO,KAAyB;QAC7C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAO,KAAyB;QAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CACP,KAAU,EACV,EAA2B,EAC3B,eAAuB,KAAK;QAE5B,MAAM,KAAK,GAAuB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACxD,EAAE,EAAE,GAAG,YAAY,IAAI,CAAC,EAAE;YAC1B,IAAI,EAAE,IAAI;YACV,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC,CAAC;QAEJ,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAE5C,mCAAmC;QACnC,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,MAAM,MAAM,CAAC,KAAK,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAO,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,KAAU,EACV,SAAwC,EACxC,eAAuB,QAAQ;QAE/B,MAAM,KAAK,GAA6B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9D,EAAE,EAAE,GAAG,YAAY,IAAI,CAAC,EAAE;YAC1B,IAAI,EAAE,IAAI;YACV,OAAO,EAAE,SAAS;SACnB,CAAC,CAAC,CAAC;QAEJ,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAE5C,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,KAAU,EACV,EAAmC,EACnC,OAAU;QAEV,IAAI,MAAM,GAAG,OAAO,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,MAAM,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC;QAC1D,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM;YACpC,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,aAAa,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;SACpE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,OAAO,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED;;OAEG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,WAAW,KAAK,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC;IACjE,CAAC;CACF"}

package/dist/query/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * @nahisaho/yata-scale - Query Module
+ *
+ * Exports for distributed query functionality
+ */
+export { QueryCoordinator } from './QueryCoordinator.js';
+export { QueryPlanner } from './QueryPlanner.js';
+export { DistributedExecutor } from './DistributedExecutor.js';
+export { WorkerPool } from './WorkerPool.js';
+export type { GraphQuery, QueryResult, QueryPlan, QueryOptions, QueryFilter, SortOrder, } from '../types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/query/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/query/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,YAAY,EACV,UAAU,EACV,WAAW,EACX,SAAS,EACT,YAAY,EACZ,WAAW,EACX,SAAS,GACV,MAAM,aAAa,CAAC"}

package/dist/query/index.js

@@ -0,0 +1,10 @@
+/**
+ * @nahisaho/yata-scale - Query Module
+ *
+ * Exports for distributed query functionality
+ */
+export { QueryCoordinator } from './QueryCoordinator.js';
+export { QueryPlanner } from './QueryPlanner.js';
+export { DistributedExecutor } from './DistributedExecutor.js';
+export { WorkerPool } from './WorkerPool.js';
+//# sourceMappingURL=index.js.map

package/dist/query/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/query/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/shard/GraphPartitionStrategy.d.ts

@@ -0,0 +1,65 @@
+/**
+ * @nahisaho/yata-scale - Graph Partition Strategy
+ *
+ * Graph-based partitioning using connected components
+ */
+import type { PartitionStrategy, PartitionStrategyType, EntityMetadata, Entity, Relationship } from '../types.js';
+/**
+ * Graph partition strategy based on connected components
+ */
+export declare class GraphPartitionStrategy implements PartitionStrategy {
+    readonly type: PartitionStrategyType;
+    private componentMap;
+    private shardIds;
+    private defaultShardId;
+    constructor(shardIds: string[]);
+    /**
+     * Initialize the partition map from entities and relationships
+     */
+    initialize(entities: Entity[], relationships: Relationship[]): Promise<void>;
+    /**
+     * Find connected components using Union-Find
+     */
+    private findConnectedComponents;
+    /**
+     * Assign components to shards using best-fit decreasing
+     */
+    private assignComponentsToShards;
+    /**
+     * Get shard ID for an entity
+     */
+    getShardId(entityId: string, _metadata?: Partial<EntityMetadata>): string;
+    /**
+     * Get shard IDs for multiple entities
+     */
+    getShardIds(entityIds: string[]): Map<string, string>;
+    /**
+     * Calculate remapping (graph partitioning requires recomputation)
+     */
+    remap(_oldShardCount: number, _newShardCount: number): Map<string, string>;
+    /**
+     * Add entity to a specific shard
+     */
+    assignEntity(entityId: string, shardId: string): void;
+    /**
+     * Add entity near related entity (locality)
+     */
+    assignEntityNear(entityId: string, relatedEntityId: string): void;
+    /**
+     * Get shard distribution statistics
+     */
+    getDistribution(): Map<string, number>;
+    /**
+     * Get all shard IDs
+     */
+    getShardIdsList(): string[];
+    /**
+     * Get shard count
+     */
+    get shardCount(): number;
+    /**
+     * Get entity count
+     */
+    get entityCount(): number;
+}
+//# sourceMappingURL=GraphPartitionStrategy.d.ts.map

package/dist/shard/GraphPartitionStrategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPartitionStrategy.d.ts","sourceRoot":"","sources":["../../src/shard/GraphPartitionStrategy.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,iBAAiB,EACjB,qBAAqB,EACrB,cAAc,EACd,MAAM,EACN,YAAY,EACb,MAAM,aAAa,CAAC;AAErB;;GAEG;AACH,qBAAa,sBAAuB,YAAW,iBAAiB;IAC9D,SAAgB,IAAI,EAAE,qBAAqB,CAAW;IACtD,OAAO,CAAC,YAAY,CAAkC;IACtD,OAAO,CAAC,QAAQ,CAAW;IAC3B,OAAO,CAAC,cAAc,CAAS;gBAEnB,QAAQ,EAAE,MAAM,EAAE;IAQ9B;;OAEG;IACG,UAAU,CACd,QAAQ,EAAE,MAAM,EAAE,EAClB,aAAa,EAAE,YAAY,EAAE,GAC5B,OAAO,CAAC,IAAI,CAAC;IA4BhB;;OAEG;IACH,OAAO,CAAC,uBAAuB;IA4D/B;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAmChC;;OAEG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAAG,MAAM;IAIzE;;OAEG;IACH,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAQrD;;OAEG;IACH,KAAK,CAAC,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAM1E;;OAEG;IACH,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IAOrD;;OAEG;IACH,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,IAAI;IASjE;;OAEG;IACH,eAAe,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IActC;;OAEG;IACH,eAAe,IAAI,MAAM,EAAE;IAI3B;;OAEG;IACH,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED;;OAEG;IACH,IAAI,WAAW,IAAI,MAAM,CAExB;CACF"}