@tanstack/db 0.0.23 → 0.0.24
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/proxy.cjs +21 -0
- package/dist/cjs/proxy.cjs.map +1 -1
- package/dist/cjs/query/builder/index.cjs +72 -0
- package/dist/cjs/query/builder/index.cjs.map +1 -1
- package/dist/cjs/query/builder/index.d.cts +64 -0
- package/dist/cjs/query/compiler/index.cjs +44 -8
- package/dist/cjs/query/compiler/index.cjs.map +1 -1
- package/dist/cjs/query/compiler/index.d.cts +4 -7
- package/dist/cjs/query/compiler/joins.cjs +14 -6
- package/dist/cjs/query/compiler/joins.cjs.map +1 -1
- package/dist/cjs/query/compiler/joins.d.cts +4 -8
- package/dist/cjs/query/compiler/types.d.cts +10 -0
- package/dist/cjs/query/optimizer.cjs +283 -0
- package/dist/cjs/query/optimizer.cjs.map +1 -0
- package/dist/cjs/query/optimizer.d.cts +42 -0
- package/dist/cjs/utils.cjs +42 -0
- package/dist/cjs/utils.cjs.map +1 -0
- package/dist/cjs/utils.d.cts +18 -0
- package/dist/esm/proxy.js +21 -0
- package/dist/esm/proxy.js.map +1 -1
- package/dist/esm/query/builder/index.d.ts +64 -0
- package/dist/esm/query/builder/index.js +72 -0
- package/dist/esm/query/builder/index.js.map +1 -1
- package/dist/esm/query/compiler/index.d.ts +4 -7
- package/dist/esm/query/compiler/index.js +44 -8
- package/dist/esm/query/compiler/index.js.map +1 -1
- package/dist/esm/query/compiler/joins.d.ts +4 -8
- package/dist/esm/query/compiler/joins.js +14 -6
- package/dist/esm/query/compiler/joins.js.map +1 -1
- package/dist/esm/query/compiler/types.d.ts +10 -0
- package/dist/esm/query/optimizer.d.ts +42 -0
- package/dist/esm/query/optimizer.js +283 -0
- package/dist/esm/query/optimizer.js.map +1 -0
- package/dist/esm/utils.d.ts +18 -0
- package/dist/esm/utils.js +42 -0
- package/dist/esm/utils.js.map +1 -0
- package/package.json +1 -1
- package/src/proxy.ts +24 -0
- package/src/query/builder/index.ts +104 -0
- package/src/query/compiler/index.ts +85 -18
- package/src/query/compiler/joins.ts +21 -13
- package/src/query/compiler/types.ts +12 -0
- package/src/query/optimizer.ts +738 -0
- package/src/utils.ts +86 -0
|
@@ -1,20 +1,25 @@
|
|
|
1
1
|
import { map, filter, distinct } from "@electric-sql/d2mini";
|
|
2
|
+
import { optimizeQuery } from "../optimizer.js";
|
|
2
3
|
import { compileExpression } from "./evaluators.js";
|
|
3
4
|
import { processJoins } from "./joins.js";
|
|
4
5
|
import { processGroupBy } from "./group-by.js";
|
|
5
6
|
import { processOrderBy } from "./order-by.js";
|
|
6
7
|
import { processSelectToResults } from "./select.js";
|
|
7
|
-
function compileQuery(
|
|
8
|
-
const cachedResult = cache.get(
|
|
8
|
+
function compileQuery(rawQuery, inputs, cache = /* @__PURE__ */ new WeakMap(), queryMapping = /* @__PURE__ */ new WeakMap()) {
|
|
9
|
+
const cachedResult = cache.get(rawQuery);
|
|
9
10
|
if (cachedResult) {
|
|
10
11
|
return cachedResult;
|
|
11
12
|
}
|
|
13
|
+
const query = optimizeQuery(rawQuery);
|
|
14
|
+
queryMapping.set(query, rawQuery);
|
|
15
|
+
mapNestedQueries(query, rawQuery, queryMapping);
|
|
12
16
|
const allInputs = { ...inputs };
|
|
13
17
|
const tables = {};
|
|
14
18
|
const { alias: mainTableAlias, input: mainInput } = processFrom(
|
|
15
19
|
query.from,
|
|
16
20
|
allInputs,
|
|
17
|
-
cache
|
|
21
|
+
cache,
|
|
22
|
+
queryMapping
|
|
18
23
|
);
|
|
19
24
|
tables[mainTableAlias] = mainInput;
|
|
20
25
|
let pipeline = mainInput.pipe(
|
|
@@ -30,7 +35,8 @@ function compileQuery(query, inputs, cache = /* @__PURE__ */ new WeakMap()) {
|
|
|
30
35
|
tables,
|
|
31
36
|
mainTableAlias,
|
|
32
37
|
allInputs,
|
|
33
|
-
cache
|
|
38
|
+
cache,
|
|
39
|
+
queryMapping
|
|
34
40
|
);
|
|
35
41
|
}
|
|
36
42
|
if (query.where && query.where.length > 0) {
|
|
@@ -139,7 +145,7 @@ function compileQuery(query, inputs, cache = /* @__PURE__ */ new WeakMap()) {
|
|
|
139
145
|
})
|
|
140
146
|
);
|
|
141
147
|
const result2 = resultPipeline2;
|
|
142
|
-
cache.set(
|
|
148
|
+
cache.set(rawQuery, result2);
|
|
143
149
|
return result2;
|
|
144
150
|
} else if (query.limit !== void 0 || query.offset !== void 0) {
|
|
145
151
|
throw new Error(
|
|
@@ -153,10 +159,10 @@ function compileQuery(query, inputs, cache = /* @__PURE__ */ new WeakMap()) {
|
|
|
153
159
|
})
|
|
154
160
|
);
|
|
155
161
|
const result = resultPipeline;
|
|
156
|
-
cache.set(
|
|
162
|
+
cache.set(rawQuery, result);
|
|
157
163
|
return result;
|
|
158
164
|
}
|
|
159
|
-
function processFrom(from, allInputs, cache) {
|
|
165
|
+
function processFrom(from, allInputs, cache, queryMapping) {
|
|
160
166
|
switch (from.type) {
|
|
161
167
|
case `collectionRef`: {
|
|
162
168
|
const input = allInputs[from.collection.id];
|
|
@@ -168,7 +174,13 @@ function processFrom(from, allInputs, cache) {
|
|
|
168
174
|
return { alias: from.alias, input };
|
|
169
175
|
}
|
|
170
176
|
case `queryRef`: {
|
|
171
|
-
const
|
|
177
|
+
const originalQuery = queryMapping.get(from.query) || from.query;
|
|
178
|
+
const subQueryInput = compileQuery(
|
|
179
|
+
originalQuery,
|
|
180
|
+
allInputs,
|
|
181
|
+
cache,
|
|
182
|
+
queryMapping
|
|
183
|
+
);
|
|
172
184
|
const extractedInput = subQueryInput.pipe(
|
|
173
185
|
map((data) => {
|
|
174
186
|
const [key, [value, _orderByIndex]] = data;
|
|
@@ -181,6 +193,30 @@ function processFrom(from, allInputs, cache) {
|
|
|
181
193
|
throw new Error(`Unsupported FROM type: ${from.type}`);
|
|
182
194
|
}
|
|
183
195
|
}
|
|
196
|
+
function mapNestedQueries(optimizedQuery, originalQuery, queryMapping) {
|
|
197
|
+
if (optimizedQuery.from.type === `queryRef` && originalQuery.from.type === `queryRef`) {
|
|
198
|
+
queryMapping.set(optimizedQuery.from.query, originalQuery.from.query);
|
|
199
|
+
mapNestedQueries(
|
|
200
|
+
optimizedQuery.from.query,
|
|
201
|
+
originalQuery.from.query,
|
|
202
|
+
queryMapping
|
|
203
|
+
);
|
|
204
|
+
}
|
|
205
|
+
if (optimizedQuery.join && originalQuery.join) {
|
|
206
|
+
for (let i = 0; i < optimizedQuery.join.length && i < originalQuery.join.length; i++) {
|
|
207
|
+
const optimizedJoin = optimizedQuery.join[i];
|
|
208
|
+
const originalJoin = originalQuery.join[i];
|
|
209
|
+
if (optimizedJoin.from.type === `queryRef` && originalJoin.from.type === `queryRef`) {
|
|
210
|
+
queryMapping.set(optimizedJoin.from.query, originalJoin.from.query);
|
|
211
|
+
mapNestedQueries(
|
|
212
|
+
optimizedJoin.from.query,
|
|
213
|
+
originalJoin.from.query,
|
|
214
|
+
queryMapping
|
|
215
|
+
);
|
|
216
|
+
}
|
|
217
|
+
}
|
|
218
|
+
}
|
|
219
|
+
}
|
|
184
220
|
export {
|
|
185
221
|
compileQuery
|
|
186
222
|
};
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sources":["../../../../src/query/compiler/index.ts"],"sourcesContent":["import { distinct, filter, map } from \"@electric-sql/d2mini\"\nimport { compileExpression } from \"./evaluators.js\"\nimport { processJoins } from \"./joins.js\"\nimport { processGroupBy } from \"./group-by.js\"\nimport { processOrderBy } from \"./order-by.js\"\nimport { processSelectToResults } from \"./select.js\"\nimport type { CollectionRef, QueryIR, QueryRef } from \"../ir.js\"\nimport type {\n KeyedStream,\n NamespacedAndKeyedStream,\n ResultStream,\n} from \"../../types.js\"\n\n/**\n * Cache for compiled subqueries to avoid duplicate compilation\n */\ntype QueryCache = WeakMap<QueryIR, ResultStream>\n\n/**\n * Compiles a query2 IR into a D2 pipeline\n * @param query The query IR to compile\n * @param inputs Mapping of collection names to input streams\n * @param cache Optional cache for compiled subqueries (used internally for recursion)\n * @returns A stream builder representing the compiled query\n */\nexport function compileQuery(\n query: QueryIR,\n inputs: Record<string, KeyedStream>,\n cache: QueryCache = new WeakMap()\n): ResultStream {\n // Check if this query has already been compiled\n const cachedResult = cache.get(query)\n if (cachedResult) {\n return cachedResult\n }\n\n // Create a copy of the inputs map to avoid modifying the original\n const allInputs = { ...inputs }\n\n // Create a map of table aliases to inputs\n const tables: Record<string, KeyedStream> = {}\n\n // Process the FROM clause to get the main table\n const { alias: mainTableAlias, input: mainInput } = processFrom(\n query.from,\n allInputs,\n cache\n )\n tables[mainTableAlias] = mainInput\n\n // Prepare the initial pipeline with the main table wrapped in its alias\n let pipeline: NamespacedAndKeyedStream = mainInput.pipe(\n map(([key, row]) => {\n // Initialize the record with a nested structure\n const ret = [key, { [mainTableAlias]: row }] as [\n string,\n Record<string, typeof row>,\n ]\n return ret\n })\n )\n\n // Process JOIN clauses if they exist\n if (query.join && query.join.length > 0) {\n pipeline = processJoins(\n pipeline,\n query.join,\n tables,\n mainTableAlias,\n allInputs,\n cache\n )\n }\n\n // Process the WHERE clause if it exists\n if (query.where && query.where.length > 0) {\n // Compile all WHERE expressions\n const compiledWheres = query.where.map((where) => compileExpression(where))\n\n // Apply each WHERE condition as a filter (they are ANDed together)\n for (const compiledWhere of compiledWheres) {\n pipeline = pipeline.pipe(\n filter(([_key, namespacedRow]) => {\n return compiledWhere(namespacedRow)\n })\n )\n }\n }\n\n // Process functional WHERE clauses if they exist\n if (query.fnWhere && query.fnWhere.length > 0) {\n for (const fnWhere of query.fnWhere) {\n pipeline = pipeline.pipe(\n filter(([_key, namespacedRow]) => {\n return fnWhere(namespacedRow)\n })\n )\n }\n }\n\n if (query.distinct && !query.fnSelect && !query.select) {\n throw new Error(`DISTINCT requires a SELECT clause.`)\n }\n\n // Process the SELECT clause early - always create __select_results\n // This eliminates duplication and allows for DISTINCT implementation\n if (query.fnSelect) {\n // Handle functional select - apply the function to transform the row\n pipeline = pipeline.pipe(\n map(([key, namespacedRow]) => {\n const selectResults = query.fnSelect!(namespacedRow)\n return [\n key,\n {\n ...namespacedRow,\n __select_results: selectResults,\n },\n ] as [string, typeof namespacedRow & { __select_results: any }]\n })\n )\n } else if (query.select) {\n pipeline = processSelectToResults(pipeline, query.select, allInputs)\n } else {\n // If no SELECT clause, create __select_results with the main table data\n pipeline = pipeline.pipe(\n map(([key, namespacedRow]) => {\n const selectResults =\n !query.join && !query.groupBy\n ? namespacedRow[mainTableAlias]\n : namespacedRow\n\n return [\n key,\n {\n ...namespacedRow,\n __select_results: selectResults,\n },\n ] as [string, typeof namespacedRow & { __select_results: any }]\n })\n )\n }\n\n // Process the GROUP BY clause if it exists\n if (query.groupBy && query.groupBy.length > 0) {\n pipeline = processGroupBy(\n pipeline,\n query.groupBy,\n query.having,\n query.select,\n query.fnHaving\n )\n } else if (query.select) {\n // Check if SELECT contains aggregates but no GROUP BY (implicit single-group aggregation)\n const hasAggregates = Object.values(query.select).some(\n (expr) => expr.type === `agg`\n )\n if (hasAggregates) {\n // Handle implicit single-group aggregation\n pipeline = processGroupBy(\n pipeline,\n [], // Empty group by means single group\n query.having,\n query.select,\n query.fnHaving\n )\n }\n }\n\n // Process the HAVING clause if it exists (only applies after GROUP BY)\n if (query.having && (!query.groupBy || query.groupBy.length === 0)) {\n // Check if we have aggregates in SELECT that would trigger implicit grouping\n const hasAggregates = query.select\n ? Object.values(query.select).some((expr) => expr.type === `agg`)\n : false\n\n if (!hasAggregates) {\n throw new Error(`HAVING clause requires GROUP BY clause`)\n }\n }\n\n // Process functional HAVING clauses outside of GROUP BY (treat as additional WHERE filters)\n if (\n query.fnHaving &&\n query.fnHaving.length > 0 &&\n (!query.groupBy || query.groupBy.length === 0)\n ) {\n // If there's no GROUP BY but there are fnHaving clauses, apply them as filters\n for (const fnHaving of query.fnHaving) {\n pipeline = pipeline.pipe(\n filter(([_key, namespacedRow]) => {\n return fnHaving(namespacedRow)\n })\n )\n }\n }\n\n // Process the DISTINCT clause if it exists\n if (query.distinct) {\n pipeline = pipeline.pipe(distinct(([_key, row]) => row.__select_results))\n }\n\n // Process orderBy parameter if it exists\n if (query.orderBy && query.orderBy.length > 0) {\n const orderedPipeline = processOrderBy(\n pipeline,\n query.orderBy,\n query.limit,\n query.offset\n )\n\n // Final step: extract the __select_results and include orderBy index\n const resultPipeline = orderedPipeline.pipe(\n map(([key, [row, orderByIndex]]) => {\n // Extract the final results from __select_results and include orderBy index\n const finalResults = (row as any).__select_results\n return [key, [finalResults, orderByIndex]] as [unknown, [any, string]]\n })\n )\n\n const result = resultPipeline\n // Cache the result before returning\n cache.set(query, result)\n return result\n } else if (query.limit !== undefined || query.offset !== undefined) {\n // If there's a limit or offset without orderBy, throw an error\n throw new Error(\n `LIMIT and OFFSET require an ORDER BY clause to ensure deterministic results`\n )\n }\n\n // Final step: extract the __select_results and return tuple format (no orderBy)\n const resultPipeline: ResultStream = pipeline.pipe(\n map(([key, row]) => {\n // Extract the final results from __select_results and return [key, [results, undefined]]\n const finalResults = (row as any).__select_results\n return [key, [finalResults, undefined]] as [\n unknown,\n [any, string | undefined],\n ]\n })\n )\n\n const result = resultPipeline\n // Cache the result before returning\n cache.set(query, result)\n return result\n}\n\n/**\n * Processes the FROM clause to extract the main table alias and input stream\n */\nfunction processFrom(\n from: CollectionRef | QueryRef,\n allInputs: Record<string, KeyedStream>,\n cache: QueryCache\n): { alias: string; input: KeyedStream } {\n switch (from.type) {\n case `collectionRef`: {\n const input = allInputs[from.collection.id]\n if (!input) {\n throw new Error(\n `Input for collection \"${from.collection.id}\" not found in inputs map`\n )\n }\n return { alias: from.alias, input }\n }\n case `queryRef`: {\n // Recursively compile the sub-query with cache\n const subQueryInput = compileQuery(from.query, allInputs, cache)\n\n // Subqueries may return [key, [value, orderByIndex]] (with ORDER BY) or [key, value] (without ORDER BY)\n // We need to extract just the value for use in parent queries\n const extractedInput = subQueryInput.pipe(\n map((data: any) => {\n const [key, [value, _orderByIndex]] = data\n return [key, value] as [unknown, any]\n })\n )\n\n return { alias: from.alias, input: extractedInput }\n }\n default:\n throw new Error(`Unsupported FROM type: ${(from as any).type}`)\n }\n}\n"],"names":["resultPipeline","result"],"mappings":";;;;;;AAyBO,SAAS,aACd,OACA,QACA,QAAoB,oBAAI,WACV;AAEd,QAAM,eAAe,MAAM,IAAI,KAAK;AACpC,MAAI,cAAc;AAChB,WAAO;AAAA,EACT;AAGA,QAAM,YAAY,EAAE,GAAG,OAAA;AAGvB,QAAM,SAAsC,CAAA;AAG5C,QAAM,EAAE,OAAO,gBAAgB,OAAO,cAAc;AAAA,IAClD,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EAAA;AAEF,SAAO,cAAc,IAAI;AAGzB,MAAI,WAAqC,UAAU;AAAA,IACjD,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;AAElB,YAAM,MAAM,CAAC,KAAK,EAAE,CAAC,cAAc,GAAG,KAAK;AAI3C,aAAO;AAAA,IACT,CAAC;AAAA,EAAA;AAIH,MAAI,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;AACvC,eAAW;AAAA,MACT;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAGA,MAAI,MAAM,SAAS,MAAM,MAAM,SAAS,GAAG;AAEzC,UAAM,iBAAiB,MAAM,MAAM,IAAI,CAAC,UAAU,kBAAkB,KAAK,CAAC;AAG1E,eAAW,iBAAiB,gBAAgB;AAC1C,iBAAW,SAAS;AAAA,QAClB,OAAO,CAAC,CAAC,MAAM,aAAa,MAAM;AAChC,iBAAO,cAAc,aAAa;AAAA,QACpC,CAAC;AAAA,MAAA;AAAA,IAEL;AAAA,EACF;AAGA,MAAI,MAAM,WAAW,MAAM,QAAQ,SAAS,GAAG;AAC7C,eAAW,WAAW,MAAM,SAAS;AACnC,iBAAW,SAAS;AAAA,QAClB,OAAO,CAAC,CAAC,MAAM,aAAa,MAAM;AAChC,iBAAO,QAAQ,aAAa;AAAA,QAC9B,CAAC;AAAA,MAAA;AAAA,IAEL;AAAA,EACF;AAEA,MAAI,MAAM,YAAY,CAAC,MAAM,YAAY,CAAC,MAAM,QAAQ;AACtD,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AAIA,MAAI,MAAM,UAAU;AAElB,eAAW,SAAS;AAAA,MAClB,IAAI,CAAC,CAAC,KAAK,aAAa,MAAM;AAC5B,cAAM,gBAAgB,MAAM,SAAU,aAAa;AACnD,eAAO;AAAA,UACL;AAAA,UACA;AAAA,YACE,GAAG;AAAA,YACH,kBAAkB;AAAA,UAAA;AAAA,QACpB;AAAA,MAEJ,CAAC;AAAA,IAAA;AAAA,EAEL,WAAW,MAAM,QAAQ;AACvB,eAAW,uBAAuB,UAAU,MAAM,MAAiB;AAAA,EACrE,OAAO;AAEL,eAAW,SAAS;AAAA,MAClB,IAAI,CAAC,CAAC,KAAK,aAAa,MAAM;AAC5B,cAAM,gBACJ,CAAC,MAAM,QAAQ,CAAC,MAAM,UAClB,cAAc,cAAc,IAC5B;AAEN,eAAO;AAAA,UACL;AAAA,UACA;AAAA,YACE,GAAG;AAAA,YACH,kBAAkB;AAAA,UAAA;AAAA,QACpB;AAAA,MAEJ,CAAC;AAAA,IAAA;AAAA,EAEL;AAGA,MAAI,MAAM,WAAW,MAAM,QAAQ,SAAS,GAAG;AAC7C,eAAW;AAAA,MACT;AAAA,MACA,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IAAA;AAAA,EAEV,WAAW,MAAM,QAAQ;AAEvB,UAAM,gBAAgB,OAAO,OAAO,MAAM,MAAM,EAAE;AAAA,MAChD,CAAC,SAAS,KAAK,SAAS;AAAA,IAAA;AAE1B,QAAI,eAAe;AAEjB,iBAAW;AAAA,QACT;AAAA,QACA,CAAA;AAAA;AAAA,QACA,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAAA,IAEV;AAAA,EACF;AAGA,MAAI,MAAM,WAAW,CAAC,MAAM,WAAW,MAAM,QAAQ,WAAW,IAAI;AAElE,UAAM,gBAAgB,MAAM,SACxB,OAAO,OAAO,MAAM,MAAM,EAAE,KAAK,CAAC,SAAS,KAAK,SAAS,KAAK,IAC9D;AAEJ,QAAI,CAAC,eAAe;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAAA,EACF;AAGA,MACE,MAAM,YACN,MAAM,SAAS,SAAS,MACvB,CAAC,MAAM,WAAW,MAAM,QAAQ,WAAW,IAC5C;AAEA,eAAW,YAAY,MAAM,UAAU;AACrC,iBAAW,SAAS;AAAA,QAClB,OAAO,CAAC,CAAC,MAAM,aAAa,MAAM;AAChC,iBAAO,SAAS,aAAa;AAAA,QAC/B,CAAC;AAAA,MAAA;AAAA,IAEL;AAAA,EACF;AAGA,MAAI,MAAM,UAAU;AAClB,eAAW,SAAS,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,gBAAgB,CAAC;AAAA,EAC1E;AAGA,MAAI,MAAM,WAAW,MAAM,QAAQ,SAAS,GAAG;AAC7C,UAAM,kBAAkB;AAAA,MACtB;AAAA,MACA,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IAAA;AAIR,UAAMA,kBAAiB,gBAAgB;AAAA,MACrC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC,MAAM;AAElC,cAAM,eAAgB,IAAY;AAClC,eAAO,CAAC,KAAK,CAAC,cAAc,YAAY,CAAC;AAAA,MAC3C,CAAC;AAAA,IAAA;AAGH,UAAMC,UAASD;AAEf,UAAM,IAAI,OAAOC,OAAM;AACvB,WAAOA;AAAAA,EACT,WAAW,MAAM,UAAU,UAAa,MAAM,WAAW,QAAW;AAElE,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AAGA,QAAM,iBAA+B,SAAS;AAAA,IAC5C,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;AAElB,YAAM,eAAgB,IAAY;AAClC,aAAO,CAAC,KAAK,CAAC,cAAc,MAAS,CAAC;AAAA,IAIxC,CAAC;AAAA,EAAA;AAGH,QAAM,SAAS;AAEf,QAAM,IAAI,OAAO,MAAM;AACvB,SAAO;AACT;AAKA,SAAS,YACP,MACA,WACA,OACuC;AACvC,UAAQ,KAAK,MAAA;AAAA,IACX,KAAK,iBAAiB;AACpB,YAAM,QAAQ,UAAU,KAAK,WAAW,EAAE;AAC1C,UAAI,CAAC,OAAO;AACV,cAAM,IAAI;AAAA,UACR,yBAAyB,KAAK,WAAW,EAAE;AAAA,QAAA;AAAA,MAE/C;AACA,aAAO,EAAE,OAAO,KAAK,OAAO,MAAA;AAAA,IAC9B;AAAA,IACA,KAAK,YAAY;AAEf,YAAM,gBAAgB,aAAa,KAAK,OAAO,WAAW,KAAK;AAI/D,YAAM,iBAAiB,cAAc;AAAA,QACnC,IAAI,CAAC,SAAc;AACjB,gBAAM,CAAC,KAAK,CAAC,OAAO,aAAa,CAAC,IAAI;AACtC,iBAAO,CAAC,KAAK,KAAK;AAAA,QACpB,CAAC;AAAA,MAAA;AAGH,aAAO,EAAE,OAAO,KAAK,OAAO,OAAO,eAAA;AAAA,IACrC;AAAA,IACA;AACE,YAAM,IAAI,MAAM,0BAA2B,KAAa,IAAI,EAAE;AAAA,EAAA;AAEpE;"}
|
|
1
|
+
{"version":3,"file":"index.js","sources":["../../../../src/query/compiler/index.ts"],"sourcesContent":["import { distinct, filter, map } from \"@electric-sql/d2mini\"\nimport { optimizeQuery } from \"../optimizer.js\"\nimport { compileExpression } from \"./evaluators.js\"\nimport { processJoins } from \"./joins.js\"\nimport { processGroupBy } from \"./group-by.js\"\nimport { processOrderBy } from \"./order-by.js\"\nimport { processSelectToResults } from \"./select.js\"\nimport type { CollectionRef, QueryIR, QueryRef } from \"../ir.js\"\nimport type {\n KeyedStream,\n NamespacedAndKeyedStream,\n ResultStream,\n} from \"../../types.js\"\nimport type { QueryCache, QueryMapping } from \"./types.js\"\n\n/**\n * Compiles a query2 IR into a D2 pipeline\n * @param rawQuery The query IR to compile\n * @param inputs Mapping of collection names to input streams\n * @param cache Optional cache for compiled subqueries (used internally for recursion)\n * @param queryMapping Optional mapping from optimized queries to original queries\n * @returns A stream builder representing the compiled query\n */\nexport function compileQuery(\n rawQuery: QueryIR,\n inputs: Record<string, KeyedStream>,\n cache: QueryCache = new WeakMap(),\n queryMapping: QueryMapping = new WeakMap()\n): ResultStream {\n // Check if the original raw query has already been compiled\n const cachedResult = cache.get(rawQuery)\n if (cachedResult) {\n return cachedResult\n }\n\n // Optimize the query before compilation\n const query = optimizeQuery(rawQuery)\n\n // Create mapping from optimized query to original for caching\n queryMapping.set(query, rawQuery)\n mapNestedQueries(query, rawQuery, queryMapping)\n\n // Create a copy of the inputs map to avoid modifying the original\n const allInputs = { ...inputs }\n\n // Create a map of table aliases to inputs\n const tables: Record<string, KeyedStream> = {}\n\n // Process the FROM clause to get the main table\n const { alias: mainTableAlias, input: mainInput } = processFrom(\n query.from,\n allInputs,\n cache,\n queryMapping\n )\n tables[mainTableAlias] = mainInput\n\n // Prepare the initial pipeline with the main table wrapped in its alias\n let pipeline: NamespacedAndKeyedStream = mainInput.pipe(\n map(([key, row]) => {\n // Initialize the record with a nested structure\n const ret = [key, { [mainTableAlias]: row }] as [\n string,\n Record<string, typeof row>,\n ]\n return ret\n })\n )\n\n // Process JOIN clauses if they exist\n if (query.join && query.join.length > 0) {\n pipeline = processJoins(\n pipeline,\n query.join,\n tables,\n mainTableAlias,\n allInputs,\n cache,\n queryMapping\n )\n }\n\n // Process the WHERE clause if it exists\n if (query.where && query.where.length > 0) {\n // Compile all WHERE expressions\n const compiledWheres = query.where.map((where) => compileExpression(where))\n\n // Apply each WHERE condition as a filter (they are ANDed together)\n for (const compiledWhere of compiledWheres) {\n pipeline = pipeline.pipe(\n filter(([_key, namespacedRow]) => {\n return compiledWhere(namespacedRow)\n })\n )\n }\n }\n\n // Process functional WHERE clauses if they exist\n if (query.fnWhere && query.fnWhere.length > 0) {\n for (const fnWhere of query.fnWhere) {\n pipeline = pipeline.pipe(\n filter(([_key, namespacedRow]) => {\n return fnWhere(namespacedRow)\n })\n )\n }\n }\n\n if (query.distinct && !query.fnSelect && !query.select) {\n throw new Error(`DISTINCT requires a SELECT clause.`)\n }\n\n // Process the SELECT clause early - always create __select_results\n // This eliminates duplication and allows for DISTINCT implementation\n if (query.fnSelect) {\n // Handle functional select - apply the function to transform the row\n pipeline = pipeline.pipe(\n map(([key, namespacedRow]) => {\n const selectResults = query.fnSelect!(namespacedRow)\n return [\n key,\n {\n ...namespacedRow,\n __select_results: selectResults,\n },\n ] as [string, typeof namespacedRow & { __select_results: any }]\n })\n )\n } else if (query.select) {\n pipeline = processSelectToResults(pipeline, query.select, allInputs)\n } else {\n // If no SELECT clause, create __select_results with the main table data\n pipeline = pipeline.pipe(\n map(([key, namespacedRow]) => {\n const selectResults =\n !query.join && !query.groupBy\n ? namespacedRow[mainTableAlias]\n : namespacedRow\n\n return [\n key,\n {\n ...namespacedRow,\n __select_results: selectResults,\n },\n ] as [string, typeof namespacedRow & { __select_results: any }]\n })\n )\n }\n\n // Process the GROUP BY clause if it exists\n if (query.groupBy && query.groupBy.length > 0) {\n pipeline = processGroupBy(\n pipeline,\n query.groupBy,\n query.having,\n query.select,\n query.fnHaving\n )\n } else if (query.select) {\n // Check if SELECT contains aggregates but no GROUP BY (implicit single-group aggregation)\n const hasAggregates = Object.values(query.select).some(\n (expr) => expr.type === `agg`\n )\n if (hasAggregates) {\n // Handle implicit single-group aggregation\n pipeline = processGroupBy(\n pipeline,\n [], // Empty group by means single group\n query.having,\n query.select,\n query.fnHaving\n )\n }\n }\n\n // Process the HAVING clause if it exists (only applies after GROUP BY)\n if (query.having && (!query.groupBy || query.groupBy.length === 0)) {\n // Check if we have aggregates in SELECT that would trigger implicit grouping\n const hasAggregates = query.select\n ? Object.values(query.select).some((expr) => expr.type === `agg`)\n : false\n\n if (!hasAggregates) {\n throw new Error(`HAVING clause requires GROUP BY clause`)\n }\n }\n\n // Process functional HAVING clauses outside of GROUP BY (treat as additional WHERE filters)\n if (\n query.fnHaving &&\n query.fnHaving.length > 0 &&\n (!query.groupBy || query.groupBy.length === 0)\n ) {\n // If there's no GROUP BY but there are fnHaving clauses, apply them as filters\n for (const fnHaving of query.fnHaving) {\n pipeline = pipeline.pipe(\n filter(([_key, namespacedRow]) => {\n return fnHaving(namespacedRow)\n })\n )\n }\n }\n\n // Process the DISTINCT clause if it exists\n if (query.distinct) {\n pipeline = pipeline.pipe(distinct(([_key, row]) => row.__select_results))\n }\n\n // Process orderBy parameter if it exists\n if (query.orderBy && query.orderBy.length > 0) {\n const orderedPipeline = processOrderBy(\n pipeline,\n query.orderBy,\n query.limit,\n query.offset\n )\n\n // Final step: extract the __select_results and include orderBy index\n const resultPipeline = orderedPipeline.pipe(\n map(([key, [row, orderByIndex]]) => {\n // Extract the final results from __select_results and include orderBy index\n const finalResults = (row as any).__select_results\n return [key, [finalResults, orderByIndex]] as [unknown, [any, string]]\n })\n )\n\n const result = resultPipeline\n // Cache the result before returning (use original query as key)\n cache.set(rawQuery, result)\n return result\n } else if (query.limit !== undefined || query.offset !== undefined) {\n // If there's a limit or offset without orderBy, throw an error\n throw new Error(\n `LIMIT and OFFSET require an ORDER BY clause to ensure deterministic results`\n )\n }\n\n // Final step: extract the __select_results and return tuple format (no orderBy)\n const resultPipeline: ResultStream = pipeline.pipe(\n map(([key, row]) => {\n // Extract the final results from __select_results and return [key, [results, undefined]]\n const finalResults = (row as any).__select_results\n return [key, [finalResults, undefined]] as [\n unknown,\n [any, string | undefined],\n ]\n })\n )\n\n const result = resultPipeline\n // Cache the result before returning (use original query as key)\n cache.set(rawQuery, result)\n return result\n}\n\n/**\n * Processes the FROM clause to extract the main table alias and input stream\n */\nfunction processFrom(\n from: CollectionRef | QueryRef,\n allInputs: Record<string, KeyedStream>,\n cache: QueryCache,\n queryMapping: QueryMapping\n): { alias: string; input: KeyedStream } {\n switch (from.type) {\n case `collectionRef`: {\n const input = allInputs[from.collection.id]\n if (!input) {\n throw new Error(\n `Input for collection \"${from.collection.id}\" not found in inputs map`\n )\n }\n return { alias: from.alias, input }\n }\n case `queryRef`: {\n // Find the original query for caching purposes\n const originalQuery = queryMapping.get(from.query) || from.query\n\n // Recursively compile the sub-query with cache\n const subQueryInput = compileQuery(\n originalQuery,\n allInputs,\n cache,\n queryMapping\n )\n\n // Subqueries may return [key, [value, orderByIndex]] (with ORDER BY) or [key, value] (without ORDER BY)\n // We need to extract just the value for use in parent queries\n const extractedInput = subQueryInput.pipe(\n map((data: any) => {\n const [key, [value, _orderByIndex]] = data\n return [key, value] as [unknown, any]\n })\n )\n\n return { alias: from.alias, input: extractedInput }\n }\n default:\n throw new Error(`Unsupported FROM type: ${(from as any).type}`)\n }\n}\n\n/**\n * Recursively maps optimized subqueries to their original queries for proper caching.\n * This ensures that when we encounter the same QueryRef object in different contexts,\n * we can find the original query to check the cache.\n */\nfunction mapNestedQueries(\n optimizedQuery: QueryIR,\n originalQuery: QueryIR,\n queryMapping: QueryMapping\n): void {\n // Map the FROM clause if it's a QueryRef\n if (\n optimizedQuery.from.type === `queryRef` &&\n originalQuery.from.type === `queryRef`\n ) {\n queryMapping.set(optimizedQuery.from.query, originalQuery.from.query)\n // Recursively map nested queries\n mapNestedQueries(\n optimizedQuery.from.query,\n originalQuery.from.query,\n queryMapping\n )\n }\n\n // Map JOIN clauses if they exist\n if (optimizedQuery.join && originalQuery.join) {\n for (\n let i = 0;\n i < optimizedQuery.join.length && i < originalQuery.join.length;\n i++\n ) {\n const optimizedJoin = optimizedQuery.join[i]!\n const originalJoin = originalQuery.join[i]!\n\n if (\n optimizedJoin.from.type === `queryRef` &&\n originalJoin.from.type === `queryRef`\n ) {\n queryMapping.set(optimizedJoin.from.query, originalJoin.from.query)\n // Recursively map nested queries in joins\n mapNestedQueries(\n optimizedJoin.from.query,\n originalJoin.from.query,\n queryMapping\n )\n }\n }\n }\n}\n"],"names":["resultPipeline","result"],"mappings":";;;;;;;AAuBO,SAAS,aACd,UACA,QACA,QAAoB,oBAAI,WACxB,eAA6B,oBAAI,WACnB;AAEd,QAAM,eAAe,MAAM,IAAI,QAAQ;AACvC,MAAI,cAAc;AAChB,WAAO;AAAA,EACT;AAGA,QAAM,QAAQ,cAAc,QAAQ;AAGpC,eAAa,IAAI,OAAO,QAAQ;AAChC,mBAAiB,OAAO,UAAU,YAAY;AAG9C,QAAM,YAAY,EAAE,GAAG,OAAA;AAGvB,QAAM,SAAsC,CAAA;AAG5C,QAAM,EAAE,OAAO,gBAAgB,OAAO,cAAc;AAAA,IAClD,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEF,SAAO,cAAc,IAAI;AAGzB,MAAI,WAAqC,UAAU;AAAA,IACjD,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;AAElB,YAAM,MAAM,CAAC,KAAK,EAAE,CAAC,cAAc,GAAG,KAAK;AAI3C,aAAO;AAAA,IACT,CAAC;AAAA,EAAA;AAIH,MAAI,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;AACvC,eAAW;AAAA,MACT;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAGA,MAAI,MAAM,SAAS,MAAM,MAAM,SAAS,GAAG;AAEzC,UAAM,iBAAiB,MAAM,MAAM,IAAI,CAAC,UAAU,kBAAkB,KAAK,CAAC;AAG1E,eAAW,iBAAiB,gBAAgB;AAC1C,iBAAW,SAAS;AAAA,QAClB,OAAO,CAAC,CAAC,MAAM,aAAa,MAAM;AAChC,iBAAO,cAAc,aAAa;AAAA,QACpC,CAAC;AAAA,MAAA;AAAA,IAEL;AAAA,EACF;AAGA,MAAI,MAAM,WAAW,MAAM,QAAQ,SAAS,GAAG;AAC7C,eAAW,WAAW,MAAM,SAAS;AACnC,iBAAW,SAAS;AAAA,QAClB,OAAO,CAAC,CAAC,MAAM,aAAa,MAAM;AAChC,iBAAO,QAAQ,aAAa;AAAA,QAC9B,CAAC;AAAA,MAAA;AAAA,IAEL;AAAA,EACF;AAEA,MAAI,MAAM,YAAY,CAAC,MAAM,YAAY,CAAC,MAAM,QAAQ;AACtD,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AAIA,MAAI,MAAM,UAAU;AAElB,eAAW,SAAS;AAAA,MAClB,IAAI,CAAC,CAAC,KAAK,aAAa,MAAM;AAC5B,cAAM,gBAAgB,MAAM,SAAU,aAAa;AACnD,eAAO;AAAA,UACL;AAAA,UACA;AAAA,YACE,GAAG;AAAA,YACH,kBAAkB;AAAA,UAAA;AAAA,QACpB;AAAA,MAEJ,CAAC;AAAA,IAAA;AAAA,EAEL,WAAW,MAAM,QAAQ;AACvB,eAAW,uBAAuB,UAAU,MAAM,MAAiB;AAAA,EACrE,OAAO;AAEL,eAAW,SAAS;AAAA,MAClB,IAAI,CAAC,CAAC,KAAK,aAAa,MAAM;AAC5B,cAAM,gBACJ,CAAC,MAAM,QAAQ,CAAC,MAAM,UAClB,cAAc,cAAc,IAC5B;AAEN,eAAO;AAAA,UACL;AAAA,UACA;AAAA,YACE,GAAG;AAAA,YACH,kBAAkB;AAAA,UAAA;AAAA,QACpB;AAAA,MAEJ,CAAC;AAAA,IAAA;AAAA,EAEL;AAGA,MAAI,MAAM,WAAW,MAAM,QAAQ,SAAS,GAAG;AAC7C,eAAW;AAAA,MACT;AAAA,MACA,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IAAA;AAAA,EAEV,WAAW,MAAM,QAAQ;AAEvB,UAAM,gBAAgB,OAAO,OAAO,MAAM,MAAM,EAAE;AAAA,MAChD,CAAC,SAAS,KAAK,SAAS;AAAA,IAAA;AAE1B,QAAI,eAAe;AAEjB,iBAAW;AAAA,QACT;AAAA,QACA,CAAA;AAAA;AAAA,QACA,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAAA,IAEV;AAAA,EACF;AAGA,MAAI,MAAM,WAAW,CAAC,MAAM,WAAW,MAAM,QAAQ,WAAW,IAAI;AAElE,UAAM,gBAAgB,MAAM,SACxB,OAAO,OAAO,MAAM,MAAM,EAAE,KAAK,CAAC,SAAS,KAAK,SAAS,KAAK,IAC9D;AAEJ,QAAI,CAAC,eAAe;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAAA,EACF;AAGA,MACE,MAAM,YACN,MAAM,SAAS,SAAS,MACvB,CAAC,MAAM,WAAW,MAAM,QAAQ,WAAW,IAC5C;AAEA,eAAW,YAAY,MAAM,UAAU;AACrC,iBAAW,SAAS;AAAA,QAClB,OAAO,CAAC,CAAC,MAAM,aAAa,MAAM;AAChC,iBAAO,SAAS,aAAa;AAAA,QAC/B,CAAC;AAAA,MAAA;AAAA,IAEL;AAAA,EACF;AAGA,MAAI,MAAM,UAAU;AAClB,eAAW,SAAS,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,gBAAgB,CAAC;AAAA,EAC1E;AAGA,MAAI,MAAM,WAAW,MAAM,QAAQ,SAAS,GAAG;AAC7C,UAAM,kBAAkB;AAAA,MACtB;AAAA,MACA,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IAAA;AAIR,UAAMA,kBAAiB,gBAAgB;AAAA,MACrC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC,MAAM;AAElC,cAAM,eAAgB,IAAY;AAClC,eAAO,CAAC,KAAK,CAAC,cAAc,YAAY,CAAC;AAAA,MAC3C,CAAC;AAAA,IAAA;AAGH,UAAMC,UAASD;AAEf,UAAM,IAAI,UAAUC,OAAM;AAC1B,WAAOA;AAAAA,EACT,WAAW,MAAM,UAAU,UAAa,MAAM,WAAW,QAAW;AAElE,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AAGA,QAAM,iBAA+B,SAAS;AAAA,IAC5C,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;AAElB,YAAM,eAAgB,IAAY;AAClC,aAAO,CAAC,KAAK,CAAC,cAAc,MAAS,CAAC;AAAA,IAIxC,CAAC;AAAA,EAAA;AAGH,QAAM,SAAS;AAEf,QAAM,IAAI,UAAU,MAAM;AAC1B,SAAO;AACT;AAKA,SAAS,YACP,MACA,WACA,OACA,cACuC;AACvC,UAAQ,KAAK,MAAA;AAAA,IACX,KAAK,iBAAiB;AACpB,YAAM,QAAQ,UAAU,KAAK,WAAW,EAAE;AAC1C,UAAI,CAAC,OAAO;AACV,cAAM,IAAI;AAAA,UACR,yBAAyB,KAAK,WAAW,EAAE;AAAA,QAAA;AAAA,MAE/C;AACA,aAAO,EAAE,OAAO,KAAK,OAAO,MAAA;AAAA,IAC9B;AAAA,IACA,KAAK,YAAY;AAEf,YAAM,gBAAgB,aAAa,IAAI,KAAK,KAAK,KAAK,KAAK;AAG3D,YAAM,gBAAgB;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAKF,YAAM,iBAAiB,cAAc;AAAA,QACnC,IAAI,CAAC,SAAc;AACjB,gBAAM,CAAC,KAAK,CAAC,OAAO,aAAa,CAAC,IAAI;AACtC,iBAAO,CAAC,KAAK,KAAK;AAAA,QACpB,CAAC;AAAA,MAAA;AAGH,aAAO,EAAE,OAAO,KAAK,OAAO,OAAO,eAAA;AAAA,IACrC;AAAA,IACA;AACE,YAAM,IAAI,MAAM,0BAA2B,KAAa,IAAI,EAAE;AAAA,EAAA;AAEpE;AAOA,SAAS,iBACP,gBACA,eACA,cACM;AAEN,MACE,eAAe,KAAK,SAAS,cAC7B,cAAc,KAAK,SAAS,YAC5B;AACA,iBAAa,IAAI,eAAe,KAAK,OAAO,cAAc,KAAK,KAAK;AAEpE;AAAA,MACE,eAAe,KAAK;AAAA,MACpB,cAAc,KAAK;AAAA,MACnB;AAAA,IAAA;AAAA,EAEJ;AAGA,MAAI,eAAe,QAAQ,cAAc,MAAM;AAC7C,aACM,IAAI,GACR,IAAI,eAAe,KAAK,UAAU,IAAI,cAAc,KAAK,QACzD,KACA;AACA,YAAM,gBAAgB,eAAe,KAAK,CAAC;AAC3C,YAAM,eAAe,cAAc,KAAK,CAAC;AAEzC,UACE,cAAc,KAAK,SAAS,cAC5B,aAAa,KAAK,SAAS,YAC3B;AACA,qBAAa,IAAI,cAAc,KAAK,OAAO,aAAa,KAAK,KAAK;AAElE;AAAA,UACE,cAAc,KAAK;AAAA,UACnB,aAAa,KAAK;AAAA,UAClB;AAAA,QAAA;AAAA,MAEJ;AAAA,IACF;AAAA,EACF;AACF;"}
|
|
@@ -1,11 +1,7 @@
|
|
|
1
|
-
import { JoinClause
|
|
2
|
-
import { KeyedStream, NamespacedAndKeyedStream
|
|
3
|
-
|
|
4
|
-
* Cache for compiled subqueries to avoid duplicate compilation
|
|
5
|
-
*/
|
|
6
|
-
type QueryCache = WeakMap<QueryIR, ResultStream>;
|
|
1
|
+
import { JoinClause } from '../ir.js';
|
|
2
|
+
import { KeyedStream, NamespacedAndKeyedStream } from '../../types.js';
|
|
3
|
+
import { QueryCache, QueryMapping } from './types.js';
|
|
7
4
|
/**
|
|
8
5
|
* Processes all join clauses in a query
|
|
9
6
|
*/
|
|
10
|
-
export declare function processJoins(pipeline: NamespacedAndKeyedStream, joinClauses: Array<JoinClause>, tables: Record<string, KeyedStream>, mainTableAlias: string, allInputs: Record<string, KeyedStream>, cache: QueryCache): NamespacedAndKeyedStream;
|
|
11
|
-
export {};
|
|
7
|
+
export declare function processJoins(pipeline: NamespacedAndKeyedStream, joinClauses: Array<JoinClause>, tables: Record<string, KeyedStream>, mainTableAlias: string, allInputs: Record<string, KeyedStream>, cache: QueryCache, queryMapping: QueryMapping): NamespacedAndKeyedStream;
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import { map, join, consolidate, filter } from "@electric-sql/d2mini";
|
|
2
2
|
import { compileExpression } from "./evaluators.js";
|
|
3
3
|
import { compileQuery } from "./index.js";
|
|
4
|
-
function processJoins(pipeline, joinClauses, tables, mainTableAlias, allInputs, cache) {
|
|
4
|
+
function processJoins(pipeline, joinClauses, tables, mainTableAlias, allInputs, cache, queryMapping) {
|
|
5
5
|
let resultPipeline = pipeline;
|
|
6
6
|
for (const joinClause of joinClauses) {
|
|
7
7
|
resultPipeline = processJoin(
|
|
@@ -10,16 +10,18 @@ function processJoins(pipeline, joinClauses, tables, mainTableAlias, allInputs,
|
|
|
10
10
|
tables,
|
|
11
11
|
mainTableAlias,
|
|
12
12
|
allInputs,
|
|
13
|
-
cache
|
|
13
|
+
cache,
|
|
14
|
+
queryMapping
|
|
14
15
|
);
|
|
15
16
|
}
|
|
16
17
|
return resultPipeline;
|
|
17
18
|
}
|
|
18
|
-
function processJoin(pipeline, joinClause, tables, mainTableAlias, allInputs, cache) {
|
|
19
|
+
function processJoin(pipeline, joinClause, tables, mainTableAlias, allInputs, cache, queryMapping) {
|
|
19
20
|
const { alias: joinedTableAlias, input: joinedInput } = processJoinSource(
|
|
20
21
|
joinClause.from,
|
|
21
22
|
allInputs,
|
|
22
|
-
cache
|
|
23
|
+
cache,
|
|
24
|
+
queryMapping
|
|
23
25
|
);
|
|
24
26
|
tables[joinedTableAlias] = joinedInput;
|
|
25
27
|
const joinType = joinClause.type === `cross` ? `inner` : joinClause.type === `outer` ? `full` : joinClause.type;
|
|
@@ -47,7 +49,7 @@ function processJoin(pipeline, joinClause, tables, mainTableAlias, allInputs, ca
|
|
|
47
49
|
processJoinResults(joinClause.type)
|
|
48
50
|
);
|
|
49
51
|
}
|
|
50
|
-
function processJoinSource(from, allInputs, cache) {
|
|
52
|
+
function processJoinSource(from, allInputs, cache, queryMapping) {
|
|
51
53
|
switch (from.type) {
|
|
52
54
|
case `collectionRef`: {
|
|
53
55
|
const input = allInputs[from.collection.id];
|
|
@@ -59,7 +61,13 @@ function processJoinSource(from, allInputs, cache) {
|
|
|
59
61
|
return { alias: from.alias, input };
|
|
60
62
|
}
|
|
61
63
|
case `queryRef`: {
|
|
62
|
-
const
|
|
64
|
+
const originalQuery = queryMapping.get(from.query) || from.query;
|
|
65
|
+
const subQueryInput = compileQuery(
|
|
66
|
+
originalQuery,
|
|
67
|
+
allInputs,
|
|
68
|
+
cache,
|
|
69
|
+
queryMapping
|
|
70
|
+
);
|
|
63
71
|
const extractedInput = subQueryInput.pipe(
|
|
64
72
|
map((data) => {
|
|
65
73
|
const [key, [value, _orderByIndex]] = data;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"joins.js","sources":["../../../../src/query/compiler/joins.ts"],"sourcesContent":["import {\n consolidate,\n filter,\n join as joinOperator,\n map,\n} from \"@electric-sql/d2mini\"\nimport { compileExpression } from \"./evaluators.js\"\nimport { compileQuery } from \"./index.js\"\nimport type { IStreamBuilder, JoinType } from \"@electric-sql/d2mini\"\nimport type { CollectionRef, JoinClause,
|
|
1
|
+
{"version":3,"file":"joins.js","sources":["../../../../src/query/compiler/joins.ts"],"sourcesContent":["import {\n consolidate,\n filter,\n join as joinOperator,\n map,\n} from \"@electric-sql/d2mini\"\nimport { compileExpression } from \"./evaluators.js\"\nimport { compileQuery } from \"./index.js\"\nimport type { IStreamBuilder, JoinType } from \"@electric-sql/d2mini\"\nimport type { CollectionRef, JoinClause, QueryRef } from \"../ir.js\"\nimport type {\n KeyedStream,\n NamespacedAndKeyedStream,\n NamespacedRow,\n} from \"../../types.js\"\nimport type { QueryCache, QueryMapping } from \"./types.js\"\n\n/**\n * Processes all join clauses in a query\n */\nexport function processJoins(\n pipeline: NamespacedAndKeyedStream,\n joinClauses: Array<JoinClause>,\n tables: Record<string, KeyedStream>,\n mainTableAlias: string,\n allInputs: Record<string, KeyedStream>,\n cache: QueryCache,\n queryMapping: QueryMapping\n): NamespacedAndKeyedStream {\n let resultPipeline = pipeline\n\n for (const joinClause of joinClauses) {\n resultPipeline = processJoin(\n resultPipeline,\n joinClause,\n tables,\n mainTableAlias,\n allInputs,\n cache,\n queryMapping\n )\n }\n\n return resultPipeline\n}\n\n/**\n * Processes a single join clause\n */\nfunction processJoin(\n pipeline: NamespacedAndKeyedStream,\n joinClause: JoinClause,\n tables: Record<string, KeyedStream>,\n mainTableAlias: string,\n allInputs: Record<string, KeyedStream>,\n cache: QueryCache,\n queryMapping: QueryMapping\n): NamespacedAndKeyedStream {\n // Get the joined table alias and input stream\n const { alias: joinedTableAlias, input: joinedInput } = processJoinSource(\n joinClause.from,\n allInputs,\n cache,\n queryMapping\n )\n\n // Add the joined table to the tables map\n tables[joinedTableAlias] = joinedInput\n\n // Convert join type to D2 join type\n const joinType: JoinType =\n joinClause.type === `cross`\n ? `inner`\n : joinClause.type === `outer`\n ? `full`\n : (joinClause.type as JoinType)\n\n // Pre-compile the join expressions\n const compiledLeftExpr = compileExpression(joinClause.left)\n const compiledRightExpr = compileExpression(joinClause.right)\n\n // Prepare the main pipeline for joining\n const mainPipeline = pipeline.pipe(\n map(([currentKey, namespacedRow]) => {\n // Extract the join key from the left side of the join condition\n const leftKey = compiledLeftExpr(namespacedRow)\n\n // Return [joinKey, [originalKey, namespacedRow]]\n return [leftKey, [currentKey, namespacedRow]] as [\n unknown,\n [string, typeof namespacedRow],\n ]\n })\n )\n\n // Prepare the joined pipeline\n const joinedPipeline = joinedInput.pipe(\n map(([currentKey, row]) => {\n // Wrap the row in a namespaced structure\n const namespacedRow: NamespacedRow = { [joinedTableAlias]: row }\n\n // Extract the join key from the right side of the join condition\n const rightKey = compiledRightExpr(namespacedRow)\n\n // Return [joinKey, [originalKey, namespacedRow]]\n return [rightKey, [currentKey, namespacedRow]] as [\n unknown,\n [string, typeof namespacedRow],\n ]\n })\n )\n\n // Apply the join operation\n if (![`inner`, `left`, `right`, `full`].includes(joinType)) {\n throw new Error(`Unsupported join type: ${joinClause.type}`)\n }\n return mainPipeline.pipe(\n joinOperator(joinedPipeline, joinType),\n consolidate(),\n processJoinResults(joinClause.type)\n )\n}\n\n/**\n * Processes the join source (collection or sub-query)\n */\nfunction processJoinSource(\n from: CollectionRef | QueryRef,\n allInputs: Record<string, KeyedStream>,\n cache: QueryCache,\n queryMapping: QueryMapping\n): { alias: string; input: KeyedStream } {\n switch (from.type) {\n case `collectionRef`: {\n const input = allInputs[from.collection.id]\n if (!input) {\n throw new Error(\n `Input for collection \"${from.collection.id}\" not found in inputs map`\n )\n }\n return { alias: from.alias, input }\n }\n case `queryRef`: {\n // Find the original query for caching purposes\n const originalQuery = queryMapping.get(from.query) || from.query\n\n // Recursively compile the sub-query with cache\n const subQueryInput = compileQuery(\n originalQuery,\n allInputs,\n cache,\n queryMapping\n )\n\n // Subqueries may return [key, [value, orderByIndex]] (with ORDER BY) or [key, value] (without ORDER BY)\n // We need to extract just the value for use in parent queries\n const extractedInput = subQueryInput.pipe(\n map((data: any) => {\n const [key, [value, _orderByIndex]] = data\n return [key, value] as [unknown, any]\n })\n )\n\n return { alias: from.alias, input: extractedInput as KeyedStream }\n }\n default:\n throw new Error(`Unsupported join source type: ${(from as any).type}`)\n }\n}\n\n/**\n * Processes the results of a join operation\n */\nfunction processJoinResults(joinType: string) {\n return function (\n pipeline: IStreamBuilder<\n [\n key: string,\n [\n [string, NamespacedRow] | undefined,\n [string, NamespacedRow] | undefined,\n ],\n ]\n >\n ): NamespacedAndKeyedStream {\n return pipeline.pipe(\n // Process the join result and handle nulls\n filter((result) => {\n const [_key, [main, joined]] = result\n const mainNamespacedRow = main?.[1]\n const joinedNamespacedRow = joined?.[1]\n\n // Handle different join types\n if (joinType === `inner`) {\n return !!(mainNamespacedRow && joinedNamespacedRow)\n }\n\n if (joinType === `left`) {\n return !!mainNamespacedRow\n }\n\n if (joinType === `right`) {\n return !!joinedNamespacedRow\n }\n\n // For full joins, always include\n return true\n }),\n map((result) => {\n const [_key, [main, joined]] = result\n const mainKey = main?.[0]\n const mainNamespacedRow = main?.[1]\n const joinedKey = joined?.[0]\n const joinedNamespacedRow = joined?.[1]\n\n // Merge the namespaced rows\n const mergedNamespacedRow: NamespacedRow = {}\n\n // Add main row data if it exists\n if (mainNamespacedRow) {\n Object.assign(mergedNamespacedRow, mainNamespacedRow)\n }\n\n // Add joined row data if it exists\n if (joinedNamespacedRow) {\n Object.assign(mergedNamespacedRow, joinedNamespacedRow)\n }\n\n // We create a composite key that combines the main and joined keys\n const resultKey = `[${mainKey},${joinedKey}]`\n\n return [resultKey, mergedNamespacedRow] as [string, NamespacedRow]\n })\n )\n }\n}\n"],"names":["joinOperator"],"mappings":";;;AAoBO,SAAS,aACd,UACA,aACA,QACA,gBACA,WACA,OACA,cAC0B;AAC1B,MAAI,iBAAiB;AAErB,aAAW,cAAc,aAAa;AACpC,qBAAiB;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAEA,SAAO;AACT;AAKA,SAAS,YACP,UACA,YACA,QACA,gBACA,WACA,OACA,cAC0B;AAE1B,QAAM,EAAE,OAAO,kBAAkB,OAAO,gBAAgB;AAAA,IACtD,WAAW;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAIF,SAAO,gBAAgB,IAAI;AAG3B,QAAM,WACJ,WAAW,SAAS,UAChB,UACA,WAAW,SAAS,UAClB,SACC,WAAW;AAGpB,QAAM,mBAAmB,kBAAkB,WAAW,IAAI;AAC1D,QAAM,oBAAoB,kBAAkB,WAAW,KAAK;AAG5D,QAAM,eAAe,SAAS;AAAA,IAC5B,IAAI,CAAC,CAAC,YAAY,aAAa,MAAM;AAEnC,YAAM,UAAU,iBAAiB,aAAa;AAG9C,aAAO,CAAC,SAAS,CAAC,YAAY,aAAa,CAAC;AAAA,IAI9C,CAAC;AAAA,EAAA;AAIH,QAAM,iBAAiB,YAAY;AAAA,IACjC,IAAI,CAAC,CAAC,YAAY,GAAG,MAAM;AAEzB,YAAM,gBAA+B,EAAE,CAAC,gBAAgB,GAAG,IAAA;AAG3D,YAAM,WAAW,kBAAkB,aAAa;AAGhD,aAAO,CAAC,UAAU,CAAC,YAAY,aAAa,CAAC;AAAA,IAI/C,CAAC;AAAA,EAAA;AAIH,MAAI,CAAC,CAAC,SAAS,QAAQ,SAAS,MAAM,EAAE,SAAS,QAAQ,GAAG;AAC1D,UAAM,IAAI,MAAM,0BAA0B,WAAW,IAAI,EAAE;AAAA,EAC7D;AACA,SAAO,aAAa;AAAA,IAClBA,KAAa,gBAAgB,QAAQ;AAAA,IACrC,YAAA;AAAA,IACA,mBAAmB,WAAW,IAAI;AAAA,EAAA;AAEtC;AAKA,SAAS,kBACP,MACA,WACA,OACA,cACuC;AACvC,UAAQ,KAAK,MAAA;AAAA,IACX,KAAK,iBAAiB;AACpB,YAAM,QAAQ,UAAU,KAAK,WAAW,EAAE;AAC1C,UAAI,CAAC,OAAO;AACV,cAAM,IAAI;AAAA,UACR,yBAAyB,KAAK,WAAW,EAAE;AAAA,QAAA;AAAA,MAE/C;AACA,aAAO,EAAE,OAAO,KAAK,OAAO,MAAA;AAAA,IAC9B;AAAA,IACA,KAAK,YAAY;AAEf,YAAM,gBAAgB,aAAa,IAAI,KAAK,KAAK,KAAK,KAAK;AAG3D,YAAM,gBAAgB;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAKF,YAAM,iBAAiB,cAAc;AAAA,QACnC,IAAI,CAAC,SAAc;AACjB,gBAAM,CAAC,KAAK,CAAC,OAAO,aAAa,CAAC,IAAI;AACtC,iBAAO,CAAC,KAAK,KAAK;AAAA,QACpB,CAAC;AAAA,MAAA;AAGH,aAAO,EAAE,OAAO,KAAK,OAAO,OAAO,eAAA;AAAA,IACrC;AAAA,IACA;AACE,YAAM,IAAI,MAAM,iCAAkC,KAAa,IAAI,EAAE;AAAA,EAAA;AAE3E;AAKA,SAAS,mBAAmB,UAAkB;AAC5C,SAAO,SACL,UAS0B;AAC1B,WAAO,SAAS;AAAA;AAAA,MAEd,OAAO,CAAC,WAAW;AACjB,cAAM,CAAC,MAAM,CAAC,MAAM,MAAM,CAAC,IAAI;AAC/B,cAAM,oBAAoB,6BAAO;AACjC,cAAM,sBAAsB,iCAAS;AAGrC,YAAI,aAAa,SAAS;AACxB,iBAAO,CAAC,EAAE,qBAAqB;AAAA,QACjC;AAEA,YAAI,aAAa,QAAQ;AACvB,iBAAO,CAAC,CAAC;AAAA,QACX;AAEA,YAAI,aAAa,SAAS;AACxB,iBAAO,CAAC,CAAC;AAAA,QACX;AAGA,eAAO;AAAA,MACT,CAAC;AAAA,MACD,IAAI,CAAC,WAAW;AACd,cAAM,CAAC,MAAM,CAAC,MAAM,MAAM,CAAC,IAAI;AAC/B,cAAM,UAAU,6BAAO;AACvB,cAAM,oBAAoB,6BAAO;AACjC,cAAM,YAAY,iCAAS;AAC3B,cAAM,sBAAsB,iCAAS;AAGrC,cAAM,sBAAqC,CAAA;AAG3C,YAAI,mBAAmB;AACrB,iBAAO,OAAO,qBAAqB,iBAAiB;AAAA,QACtD;AAGA,YAAI,qBAAqB;AACvB,iBAAO,OAAO,qBAAqB,mBAAmB;AAAA,QACxD;AAGA,cAAM,YAAY,IAAI,OAAO,IAAI,SAAS;AAE1C,eAAO,CAAC,WAAW,mBAAmB;AAAA,MACxC,CAAC;AAAA,IAAA;AAAA,EAEL;AACF;"}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
import { QueryIR } from '../ir.js';
|
|
2
|
+
import { ResultStream } from '../../types.js';
|
|
3
|
+
/**
|
|
4
|
+
* Cache for compiled subqueries to avoid duplicate compilation
|
|
5
|
+
*/
|
|
6
|
+
export type QueryCache = WeakMap<QueryIR, ResultStream>;
|
|
7
|
+
/**
|
|
8
|
+
* Mapping from optimized queries back to their original queries for caching
|
|
9
|
+
*/
|
|
10
|
+
export type QueryMapping = WeakMap<QueryIR, QueryIR>;
|
|
@@ -0,0 +1,42 @@
|
|
|
1
|
+
import { BasicExpression, QueryIR } from './ir.js';
|
|
2
|
+
/**
|
|
3
|
+
* Represents a WHERE clause after source analysis
|
|
4
|
+
*/
|
|
5
|
+
export interface AnalyzedWhereClause {
|
|
6
|
+
/** The WHERE expression */
|
|
7
|
+
expression: BasicExpression<boolean>;
|
|
8
|
+
/** Set of table/source aliases that this WHERE clause touches */
|
|
9
|
+
touchedSources: Set<string>;
|
|
10
|
+
}
|
|
11
|
+
/**
|
|
12
|
+
* Represents WHERE clauses grouped by the sources they touch
|
|
13
|
+
*/
|
|
14
|
+
export interface GroupedWhereClauses {
|
|
15
|
+
/** WHERE clauses that touch only a single source, grouped by source alias */
|
|
16
|
+
singleSource: Map<string, BasicExpression<boolean>>;
|
|
17
|
+
/** WHERE clauses that touch multiple sources, combined into one expression */
|
|
18
|
+
multiSource?: BasicExpression<boolean>;
|
|
19
|
+
}
|
|
20
|
+
/**
|
|
21
|
+
* Main query optimizer entry point that lifts WHERE clauses into subqueries.
|
|
22
|
+
*
|
|
23
|
+
* This function implements multi-level predicate pushdown optimization by recursively
|
|
24
|
+
* moving WHERE clauses through nested subqueries to get them as close to the data
|
|
25
|
+
* sources as possible, then removing redundant subqueries.
|
|
26
|
+
*
|
|
27
|
+
* @param query - The QueryIR to optimize
|
|
28
|
+
* @returns A new QueryIR with optimizations applied (or original if no optimization possible)
|
|
29
|
+
*
|
|
30
|
+
* @example
|
|
31
|
+
* ```typescript
|
|
32
|
+
* const originalQuery = {
|
|
33
|
+
* from: new CollectionRef(users, 'u'),
|
|
34
|
+
* join: [{ from: new CollectionRef(posts, 'p'), ... }],
|
|
35
|
+
* where: [eq(u.dept_id, 1), gt(p.views, 100)]
|
|
36
|
+
* }
|
|
37
|
+
*
|
|
38
|
+
* const optimized = optimizeQuery(originalQuery)
|
|
39
|
+
* // Result: Single-source clauses moved to deepest possible subqueries
|
|
40
|
+
* ```
|
|
41
|
+
*/
|
|
42
|
+
export declare function optimizeQuery(query: QueryIR): QueryIR;
|
|
@@ -0,0 +1,283 @@
|
|
|
1
|
+
import { deepEquals } from "../utils.js";
|
|
2
|
+
import { QueryRef, CollectionRef, Func } from "./ir.js";
|
|
3
|
+
function optimizeQuery(query) {
|
|
4
|
+
let optimized = query;
|
|
5
|
+
let previousOptimized;
|
|
6
|
+
let iterations = 0;
|
|
7
|
+
const maxIterations = 10;
|
|
8
|
+
while (iterations < maxIterations && !deepEquals(optimized, previousOptimized)) {
|
|
9
|
+
previousOptimized = optimized;
|
|
10
|
+
optimized = applyRecursiveOptimization(optimized);
|
|
11
|
+
iterations++;
|
|
12
|
+
}
|
|
13
|
+
const cleaned = removeRedundantSubqueries(optimized);
|
|
14
|
+
return cleaned;
|
|
15
|
+
}
|
|
16
|
+
function applyRecursiveOptimization(query) {
|
|
17
|
+
var _a;
|
|
18
|
+
const subqueriesOptimized = {
|
|
19
|
+
...query,
|
|
20
|
+
from: query.from.type === `queryRef` ? new QueryRef(
|
|
21
|
+
applyRecursiveOptimization(query.from.query),
|
|
22
|
+
query.from.alias
|
|
23
|
+
) : query.from,
|
|
24
|
+
join: (_a = query.join) == null ? void 0 : _a.map((joinClause) => ({
|
|
25
|
+
...joinClause,
|
|
26
|
+
from: joinClause.from.type === `queryRef` ? new QueryRef(
|
|
27
|
+
applyRecursiveOptimization(joinClause.from.query),
|
|
28
|
+
joinClause.from.alias
|
|
29
|
+
) : joinClause.from
|
|
30
|
+
}))
|
|
31
|
+
};
|
|
32
|
+
return applySingleLevelOptimization(subqueriesOptimized);
|
|
33
|
+
}
|
|
34
|
+
function applySingleLevelOptimization(query) {
|
|
35
|
+
if (!query.where || query.where.length === 0) {
|
|
36
|
+
return query;
|
|
37
|
+
}
|
|
38
|
+
if (!query.join || query.join.length === 0) {
|
|
39
|
+
return query;
|
|
40
|
+
}
|
|
41
|
+
const splitWhereClauses = splitAndClauses(query.where);
|
|
42
|
+
const analyzedClauses = splitWhereClauses.map(
|
|
43
|
+
(clause) => analyzeWhereClause(clause)
|
|
44
|
+
);
|
|
45
|
+
const groupedClauses = groupWhereClauses(analyzedClauses);
|
|
46
|
+
return applyOptimizations(query, groupedClauses);
|
|
47
|
+
}
|
|
48
|
+
function removeRedundantSubqueries(query) {
|
|
49
|
+
var _a;
|
|
50
|
+
return {
|
|
51
|
+
...query,
|
|
52
|
+
from: removeRedundantFromClause(query.from),
|
|
53
|
+
join: (_a = query.join) == null ? void 0 : _a.map((joinClause) => ({
|
|
54
|
+
...joinClause,
|
|
55
|
+
from: removeRedundantFromClause(joinClause.from)
|
|
56
|
+
}))
|
|
57
|
+
};
|
|
58
|
+
}
|
|
59
|
+
function removeRedundantFromClause(from) {
|
|
60
|
+
if (from.type === `collectionRef`) {
|
|
61
|
+
return from;
|
|
62
|
+
}
|
|
63
|
+
const processedQuery = removeRedundantSubqueries(from.query);
|
|
64
|
+
if (isRedundantSubquery(processedQuery)) {
|
|
65
|
+
const innerFrom = removeRedundantFromClause(processedQuery.from);
|
|
66
|
+
if (innerFrom.type === `collectionRef`) {
|
|
67
|
+
return new CollectionRef(innerFrom.collection, from.alias);
|
|
68
|
+
} else {
|
|
69
|
+
return new QueryRef(innerFrom.query, from.alias);
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
return new QueryRef(processedQuery, from.alias);
|
|
73
|
+
}
|
|
74
|
+
function isRedundantSubquery(query) {
|
|
75
|
+
return (!query.where || query.where.length === 0) && !query.select && (!query.groupBy || query.groupBy.length === 0) && (!query.having || query.having.length === 0) && (!query.orderBy || query.orderBy.length === 0) && (!query.join || query.join.length === 0) && query.limit === void 0 && query.offset === void 0 && !query.fnSelect && (!query.fnWhere || query.fnWhere.length === 0) && (!query.fnHaving || query.fnHaving.length === 0);
|
|
76
|
+
}
|
|
77
|
+
function splitAndClauses(whereClauses) {
|
|
78
|
+
const result = [];
|
|
79
|
+
for (const clause of whereClauses) {
|
|
80
|
+
if (clause.type === `func` && clause.name === `and`) {
|
|
81
|
+
const splitArgs = splitAndClauses(
|
|
82
|
+
clause.args
|
|
83
|
+
);
|
|
84
|
+
result.push(...splitArgs);
|
|
85
|
+
} else {
|
|
86
|
+
result.push(clause);
|
|
87
|
+
}
|
|
88
|
+
}
|
|
89
|
+
return result;
|
|
90
|
+
}
|
|
91
|
+
function analyzeWhereClause(clause) {
|
|
92
|
+
const touchedSources = /* @__PURE__ */ new Set();
|
|
93
|
+
function collectSources(expr) {
|
|
94
|
+
switch (expr.type) {
|
|
95
|
+
case `ref`:
|
|
96
|
+
if (expr.path && expr.path.length > 0) {
|
|
97
|
+
const firstElement = expr.path[0];
|
|
98
|
+
if (firstElement) {
|
|
99
|
+
touchedSources.add(firstElement);
|
|
100
|
+
}
|
|
101
|
+
}
|
|
102
|
+
break;
|
|
103
|
+
case `func`:
|
|
104
|
+
if (expr.args) {
|
|
105
|
+
expr.args.forEach(collectSources);
|
|
106
|
+
}
|
|
107
|
+
break;
|
|
108
|
+
case `val`:
|
|
109
|
+
break;
|
|
110
|
+
case `agg`:
|
|
111
|
+
if (expr.args) {
|
|
112
|
+
expr.args.forEach(collectSources);
|
|
113
|
+
}
|
|
114
|
+
break;
|
|
115
|
+
}
|
|
116
|
+
}
|
|
117
|
+
collectSources(clause);
|
|
118
|
+
return {
|
|
119
|
+
expression: clause,
|
|
120
|
+
touchedSources
|
|
121
|
+
};
|
|
122
|
+
}
|
|
123
|
+
function groupWhereClauses(analyzedClauses) {
|
|
124
|
+
const singleSource = /* @__PURE__ */ new Map();
|
|
125
|
+
const multiSource = [];
|
|
126
|
+
for (const clause of analyzedClauses) {
|
|
127
|
+
if (clause.touchedSources.size === 1) {
|
|
128
|
+
const source = Array.from(clause.touchedSources)[0];
|
|
129
|
+
if (!singleSource.has(source)) {
|
|
130
|
+
singleSource.set(source, []);
|
|
131
|
+
}
|
|
132
|
+
singleSource.get(source).push(clause.expression);
|
|
133
|
+
} else if (clause.touchedSources.size > 1) {
|
|
134
|
+
multiSource.push(clause.expression);
|
|
135
|
+
}
|
|
136
|
+
}
|
|
137
|
+
const combinedSingleSource = /* @__PURE__ */ new Map();
|
|
138
|
+
for (const [source, clauses] of singleSource) {
|
|
139
|
+
combinedSingleSource.set(source, combineWithAnd(clauses));
|
|
140
|
+
}
|
|
141
|
+
const combinedMultiSource = multiSource.length > 0 ? combineWithAnd(multiSource) : void 0;
|
|
142
|
+
return {
|
|
143
|
+
singleSource: combinedSingleSource,
|
|
144
|
+
multiSource: combinedMultiSource
|
|
145
|
+
};
|
|
146
|
+
}
|
|
147
|
+
function applyOptimizations(query, groupedClauses) {
|
|
148
|
+
const actuallyOptimized = /* @__PURE__ */ new Set();
|
|
149
|
+
const optimizedFrom = optimizeFromWithTracking(
|
|
150
|
+
query.from,
|
|
151
|
+
groupedClauses.singleSource,
|
|
152
|
+
actuallyOptimized
|
|
153
|
+
);
|
|
154
|
+
const optimizedJoins = query.join ? query.join.map((joinClause) => ({
|
|
155
|
+
...joinClause,
|
|
156
|
+
from: optimizeFromWithTracking(
|
|
157
|
+
joinClause.from,
|
|
158
|
+
groupedClauses.singleSource,
|
|
159
|
+
actuallyOptimized
|
|
160
|
+
)
|
|
161
|
+
})) : void 0;
|
|
162
|
+
const remainingWhereClauses = [];
|
|
163
|
+
if (groupedClauses.multiSource) {
|
|
164
|
+
remainingWhereClauses.push(groupedClauses.multiSource);
|
|
165
|
+
}
|
|
166
|
+
for (const [source, clause] of groupedClauses.singleSource) {
|
|
167
|
+
if (!actuallyOptimized.has(source)) {
|
|
168
|
+
remainingWhereClauses.push(clause);
|
|
169
|
+
}
|
|
170
|
+
}
|
|
171
|
+
const optimizedQuery = {
|
|
172
|
+
// Copy all non-optimized fields as-is
|
|
173
|
+
select: query.select,
|
|
174
|
+
groupBy: query.groupBy ? [...query.groupBy] : void 0,
|
|
175
|
+
having: query.having ? [...query.having] : void 0,
|
|
176
|
+
orderBy: query.orderBy ? [...query.orderBy] : void 0,
|
|
177
|
+
limit: query.limit,
|
|
178
|
+
offset: query.offset,
|
|
179
|
+
fnSelect: query.fnSelect,
|
|
180
|
+
fnWhere: query.fnWhere ? [...query.fnWhere] : void 0,
|
|
181
|
+
fnHaving: query.fnHaving ? [...query.fnHaving] : void 0,
|
|
182
|
+
// Use the optimized FROM and JOIN clauses
|
|
183
|
+
from: optimizedFrom,
|
|
184
|
+
join: optimizedJoins,
|
|
185
|
+
// Only include WHERE clauses that weren't successfully optimized
|
|
186
|
+
where: remainingWhereClauses.length > 0 ? remainingWhereClauses : []
|
|
187
|
+
};
|
|
188
|
+
return optimizedQuery;
|
|
189
|
+
}
|
|
190
|
+
function deepCopyQuery(query) {
|
|
191
|
+
return {
|
|
192
|
+
// Recursively copy the FROM clause
|
|
193
|
+
from: query.from.type === `collectionRef` ? new CollectionRef(query.from.collection, query.from.alias) : new QueryRef(deepCopyQuery(query.from.query), query.from.alias),
|
|
194
|
+
// Copy all other fields, creating new arrays where necessary
|
|
195
|
+
select: query.select,
|
|
196
|
+
join: query.join ? query.join.map((joinClause) => ({
|
|
197
|
+
type: joinClause.type,
|
|
198
|
+
left: joinClause.left,
|
|
199
|
+
right: joinClause.right,
|
|
200
|
+
from: joinClause.from.type === `collectionRef` ? new CollectionRef(
|
|
201
|
+
joinClause.from.collection,
|
|
202
|
+
joinClause.from.alias
|
|
203
|
+
) : new QueryRef(
|
|
204
|
+
deepCopyQuery(joinClause.from.query),
|
|
205
|
+
joinClause.from.alias
|
|
206
|
+
)
|
|
207
|
+
})) : void 0,
|
|
208
|
+
where: query.where ? [...query.where] : void 0,
|
|
209
|
+
groupBy: query.groupBy ? [...query.groupBy] : void 0,
|
|
210
|
+
having: query.having ? [...query.having] : void 0,
|
|
211
|
+
orderBy: query.orderBy ? [...query.orderBy] : void 0,
|
|
212
|
+
limit: query.limit,
|
|
213
|
+
offset: query.offset,
|
|
214
|
+
fnSelect: query.fnSelect,
|
|
215
|
+
fnWhere: query.fnWhere ? [...query.fnWhere] : void 0,
|
|
216
|
+
fnHaving: query.fnHaving ? [...query.fnHaving] : void 0
|
|
217
|
+
};
|
|
218
|
+
}
|
|
219
|
+
function optimizeFromWithTracking(from, singleSourceClauses, actuallyOptimized) {
|
|
220
|
+
const whereClause = singleSourceClauses.get(from.alias);
|
|
221
|
+
if (!whereClause) {
|
|
222
|
+
if (from.type === `collectionRef`) {
|
|
223
|
+
return new CollectionRef(from.collection, from.alias);
|
|
224
|
+
}
|
|
225
|
+
return new QueryRef(deepCopyQuery(from.query), from.alias);
|
|
226
|
+
}
|
|
227
|
+
if (from.type === `collectionRef`) {
|
|
228
|
+
const subQuery = {
|
|
229
|
+
from: new CollectionRef(from.collection, from.alias),
|
|
230
|
+
where: [whereClause]
|
|
231
|
+
};
|
|
232
|
+
actuallyOptimized.add(from.alias);
|
|
233
|
+
return new QueryRef(subQuery, from.alias);
|
|
234
|
+
}
|
|
235
|
+
if (!isSafeToPushIntoExistingSubquery(from.query)) {
|
|
236
|
+
return new QueryRef(deepCopyQuery(from.query), from.alias);
|
|
237
|
+
}
|
|
238
|
+
const existingWhere = from.query.where || [];
|
|
239
|
+
const optimizedSubQuery = {
|
|
240
|
+
...deepCopyQuery(from.query),
|
|
241
|
+
where: [...existingWhere, whereClause]
|
|
242
|
+
};
|
|
243
|
+
actuallyOptimized.add(from.alias);
|
|
244
|
+
return new QueryRef(optimizedSubQuery, from.alias);
|
|
245
|
+
}
|
|
246
|
+
function isSafeToPushIntoExistingSubquery(query) {
|
|
247
|
+
if (query.select) {
|
|
248
|
+
const hasAggregates = Object.values(query.select).some(
|
|
249
|
+
(expr) => expr.type === `agg`
|
|
250
|
+
);
|
|
251
|
+
if (hasAggregates) {
|
|
252
|
+
return false;
|
|
253
|
+
}
|
|
254
|
+
}
|
|
255
|
+
if (query.groupBy && query.groupBy.length > 0) {
|
|
256
|
+
return false;
|
|
257
|
+
}
|
|
258
|
+
if (query.having && query.having.length > 0) {
|
|
259
|
+
return false;
|
|
260
|
+
}
|
|
261
|
+
if (query.orderBy && query.orderBy.length > 0) {
|
|
262
|
+
if (query.limit !== void 0 || query.offset !== void 0) {
|
|
263
|
+
return false;
|
|
264
|
+
}
|
|
265
|
+
}
|
|
266
|
+
if (query.fnSelect || query.fnWhere && query.fnWhere.length > 0 || query.fnHaving && query.fnHaving.length > 0) {
|
|
267
|
+
return false;
|
|
268
|
+
}
|
|
269
|
+
return true;
|
|
270
|
+
}
|
|
271
|
+
function combineWithAnd(expressions) {
|
|
272
|
+
if (expressions.length === 0) {
|
|
273
|
+
throw new Error(`Cannot combine empty expression list`);
|
|
274
|
+
}
|
|
275
|
+
if (expressions.length === 1) {
|
|
276
|
+
return expressions[0];
|
|
277
|
+
}
|
|
278
|
+
return new Func(`and`, expressions);
|
|
279
|
+
}
|
|
280
|
+
export {
|
|
281
|
+
optimizeQuery
|
|
282
|
+
};
|
|
283
|
+
//# sourceMappingURL=optimizer.js.map
|