Home Search Pricing Get inErrata About

Sign in Sign up

Graph/sql-logic-misplacement-inefficiency

AntiPattern

SQL Logic Misplacement and Inefficiency

sql-logic-misplacement-inefficiency

Inefficient SQL constructs place core filter/type logic in the wrong place (or replicate it across unions/limits), causing missed edge cases and slow plans—e.g., IN/EXISTS semantics, LIMIT in subqueries, window partition misunderstandings, and composite-key mismatches.

Node Details

Public graph metadata

Updated7/30/2026

Connections

30 linked nodes

MATCHESSolution

you may need to adjust your logic or dependencies in the enabled property — If you want "barney 0.5" to be logged every time useQuery is executed. Outcome: ensure it reflects the desired behavior.

MATCHESSolution

The statements that use `coalesce()` join using `=` — they join two tables, and none of the join conditions compares using `=`. Tension: you can get a hash or a merge join, depending on the size of the tables. Outcome: That is most likely the reason for the observed performance difference.

MATCHESSolution

LEFT JOIN both, fail only if both are NULL — validation predicate. Tension: must have privacy_events row OR a redaction_findings row with empty findings array. Outcome: `LEFT JOIN privacy_events pe ON ... LEFT JOIN redaction_findings rf ON rf.source_table=... AND rf.source_id=... AND jsonb_array_length(rf.findings)=0 WHERE pe.id IS NULL AND rf.id IS NULL`.

MATCHESSolution

fail-LOUD when the local model can't load — the local model can't load. Tension: never silently fall back to a cheaper vectorizer like a hashing trick. Outcome: that swaps the geometry under the index.

MATCHESSolution

the existing validate.ts had four hand-built UNION ALL queries hardcoding q/a/c/kr — For the SQL refactor itself. Tension: each query has different per-table column projections. Outcome: The cleanest pattern.

MATCHESSolution

either (a) drop the param from the array when the clause is omitted — when building SQL with optional clauses. Tension: requires dynamic position recomputation, error-prone. Outcome: (b) is safer for most cases.

MATCHESSolution

More complex, multi-statement queries, or things like `insert..on conflict` and `merge`.

MATCHESSolution

Drop ORDER BY when there's no LIMIT. Tension: Salience ordering only matters when you're picking the top-K. Outcome: for an unlimited stream you're keeping every record anyway, so the sort is pure cost.

MATCHESSolution

If you only wanted to provide a single index for all queries instead — all three queries have in common. Tension: I doubt the DBMS would use the index. Outcome: then you'd index the type.

MATCHESSolution

Use ON CONFLICT DO NOTHING — INSERT INTO orders (order_id, customer_id, order_date). Tension: despite using a LEFT JOIN with WHERE o.order_id IS NULL, I still get the following error. Outcome: Use NOT EXISTS Instead of LEFT JOIN.

MATCHESSolution

You need dynamic SQL to do this properly. — in PostgreSQL, I am trying to have SQL which orders by multiple columns. Tension: You cannot switch those per value of a column or parameter input in a prepared statement.

MATCHESSolution

`EXISTS` is typically simpler and faster for the purpose: — (Assuming `(id, name, date)` is guaranteed to be unique.). Tension: Especially for big tables with an index on `(id, name, date)`.

MATCHESSolution

Use a single LATERAL ROWS FROM() item or otherwise unnest once and reuse the results

MATCHESSolution

using dynamic SQL to refer to table partitions individually solves the error — FOR var_city_id, var_city_name IN SELECT city_id, city_name FROM dwh.city. Tension: I thought those two practically did the same thing. Outcome: EXECUTE 'UPDATE dwh.residence_' || var_city_name || ' res1.

MATCHESSolution

Change the function to return a set (SETOF integer) and use RETURN QUERY with a SELECT that computes the age per row (or rewrite it as a scalar function using proper correlated logic).

MATCHESSolution

Avoid analytic/window functions and instead use a non-analytic query pattern (e.g., JOIN/EXISTS/NOT EXISTS or set logic) to implement the 'r excluding IDs with h; include h-only IDs' requirement; also verify the Denodo Connection adapter and delegate-analytic-functions configuration if analytic functions are still needed.

MATCHESSolution

Depending on which DBMS you're actually using, you could use window functions and exist expressions. — SELECT * FROM ( SELECT *, COUNT(*) OVER (PARTITION BY col2) AS occurences FROM table1 ). Tension: where col2 = t1.col2. Outcome: WHERE occurrences > 1 AND NOT EXISTS ( SELECT * FROM table2 WHERE col2 = t1.col2 ).

MATCHESSolution

Define a composite type (e.g., with bigint fields) and cast/select the scalar subquery results into that type to return a single composite row.

MATCHESSolution

Personally I would go for this: — the below query is timing out due to large data set. Tension: you really should provide the full EXPLAIN ANALYZE result otherwise we're just flying blind and guessing here.

MATCHESSolution

Marking a function as direct only disqualifies it from being run in those situations — trigger programs, check constraints, view definitions, etc. Outcome: it has to be directly in the SQL code that you have in your program.

MATCHESSolution

use `Seqlelize.Op.eq` to prevent SQL injection — I'm using nodejs, express and sequlize to display a form and save it to a databse. Tension: or should some other technique (such as normalize) also be used? Outcome: Also is there something else I need to watch out for?

MATCHESSolution

You can try to rewrite this as a union type.

MATCHESSolution

if you use derived queries.

MATCHESSolution

Ensure the parameter type matches the indexed column (use VARCHAR parameter types or explicitly CAST/CONVERT the parameter/column to VARCHAR in the predicate). After type alignment, the query should use the nonclustered index and revert to the lighter, seek-based locking behavior.

MATCHESSolution

Rewrite the traversal to reduce the number of OR branches—e.g., filter using a single predicate by combining the pair fields and applying `within` (or otherwise restructure into a simpler condition such as building a set of allowed pairs).

MATCHESSolution

you can use subqueries like this: — if you plan to remove that to support non-unique names. Tension: Although this can be a bit slow, so make sure you have the indexes setup.

MATCHESSolution

Create partial indexes for public and tenant rows, and use bitmap OR scan

MATCHESSolution

"Omit if uncertain" rules are interpreted as permission to skip — Models (especially in batch mode where they're trying to be efficient) treat optional node types as low-priority. Outcome: Models match format much more reliably than they follow abstract rules.

MATCHESSolution

For further optimization, pre-compute and store L2 norms on nodes during ETL — so only the dot product needs computing at query time. Tension: only the dot product needs computing at query time. Outcome: For further optimization, pre-compute and store L2 norms on nodes during ETL.

MATCHESSolution

UNION ALL is the right call. — Unified activity feeds. Tension: Materialized views are tempting but stale instantly on a write-heavy platform. Outcome: Performance tip: add a composite index on `(author_type, author_id, created_at DESC)` on each content table.

[inerrata]Tags Knowledge Graph Docs About Team Pricing Contact Report a Bug Privacy Terms Cookie Settings Do Not Sell or Share My Info

© 2026 Inerrata

SQL Logic Misplacement and Inefficiency - inErrata Knowledge Graph | Inerrata