Home Search Pricing Get inErrata About

Sign in Sign up

Graph/misaligned-cursor-sort-semantics

AntiPattern

Misaligned Cursor/Sort Logic

misaligned-cursor-sort-semantics

Pagination and ranking break because query predicates and ordering semantics don’t match the intended tuple, date, or tenant tie-break rules, causing indexes to be unusable, duplicates/omissions in listBy* results, and incorrect “active”/“inactive” classification.

Node Details

Public graph metadata

Updated6/25/2026

Connections

30 linked nodes

MATCHESSolution

handle a scenario when the code is fine but backend went offline — prefetching data with usePrefetchQuery. Tension: prefetch works.

MATCHESSolution

Changing the default order value on the Table definition worked as a workaround — when the values are null. Tension: not retrieving false ('none' state). Outcome: Changing the default order value on the Table definition worked as a workaround for the `column.getNextSortingOrder()` function work as I expected.

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

So, an index for the first query would look like this: — For the first query. Tension: all those matches would already be sorted. Outcome: create index idx_1 on users (first, type, createdat desc);.

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

If you are doing infinite scrolling this is the perfect use case for Keyset Pagination — For the first run. Tension: On the subsequent runs, add a `WHERE` predicate. Outcome: and `$4` should be the highest ID you got on the previous run.

MATCHESSolution

I want to retain the discrete event scoring, but also rank the racer in the series. Tension: if there are legitimate ties across different racers, I want there to be gaps in the rank. Outcome: The easiest way to solve this I think would be to issue two queries, one with the "duplicate" racers eliminated, and then a second one where I can retain the individual race data.

MATCHESSolution

Rewrite the cursor condition using `orWhere` to encode tuple ordering: `created_at > cursor.timestamp OR (created_at = cursor.timestamp AND id > cursor.id)`, keeping the same `orderBy` on `timestamp` and `id` and applying `limit(first)`.

MATCHESSolution

select rank() over (partition by order by ) as rn,* — This is a simple workaround for it. Outcome: as rn,* from ;.

MATCHESSolution

the icon on the header is always pointing "up" — Sorting DOES talk to my API correctly and the records come in sorted as expected and are rendered as such. Tension: It never flips. Outcome: Add a ternary operator to your sortIcons.sorted prop.

MATCHESSolution

Add a flag to the non-grouped rows (or grouped rows) and modify the column `sorter` to return a fixed comparison result (e.g., 0 or higher precedence) for the rows that must stay on top, otherwise use the normal comparator.

MATCHESSolution

See the javadoc for `countQuery` — for pagination queries to look up the total number of elements for a page. Tension: it is using the original query (including the sort) to perform the count which results in an invalid query. Outcome: add a custom count query which excludes the sort and everything should work as expected.

MATCHESSolution

is used page PageableDefault. Tension: I can succesfully use pagination `/demo?page=0&size=1` and sorting `/demo?sort=amount,desc` but I cannot use the combination `/demo?page=0&size=1&sort=amount. Outcome: it works.

MATCHESSolution

sort(reverseOrder()) - Added: false, Removed: false, Permutated: true. Outcome: which doesn't seem to actually add/remove items.

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

Collections.sort(data, (row1, row2) -> { — Default sorting snippet. Tension: That is a "default" custom logic that will work with your items. Outcome: you may override the `compareTo` method if needed.

MATCHESSolution

manual sorting while avoiding `table.sort()` is the best option — For codename tables. Tension: avoid deep copies, rebuild the table just once, and replace it bypassing the expensive model wrapping and UI reconstruction. Outcome: Finally, change the old table for the new one.

MATCHESSolution

the solution shown below — exceeding the SQL parameter limit. Tension: Each batch is queried separately, and the results are collected, sorted, and then paginated on the Java side. Outcome: batching the viewerIds list into smaller chunks of 2100 IDs or less.

MATCHESSolution

allTickets.sort(Comparator.comparing(Ticket::getSomeField));. Tension: Apply pagination on the sorted list. Outcome: return new PageImpl<>(allTickets.subList(start, end), pageable, allTickets.size()).

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

Add a tiebreaker to rank tenant-specific content above global content when both match — Add a tiebreaker to rank tenant-specific content above global content when both match. Tension: tenant content above public.

MATCHESSolution

Renumber the conflicting migration to the next available index — When two migration SQL files share the same index number. Tension: Verify no other code references the old filename. Outcome: 0016_seed_leech_ratio.sql → 0017_seed_leech_ratio.sql.

MATCHESSolution

the relationship types not matching your MERGE patterns — If GDS IS available. Tension: Using `UNDIRECTED` orientation is critical for PageRank on knowledge graphs. Outcome: Using `UNDIRECTED` orientation is critical for PageRank on knowledge graphs.

MATCHESSolution

Check your GDS projection includes relationship types — After fixing the projection. Tension: pageRank scores are all zero. Outcome: re-run the nightly pipeline: the graph-nightly-pipeline pg-boss job handles pageRank, Louvain, and landmark recomputation in sequence.

MATCHESSolution

Added Cursor Tier 3 tests for error-search, orientation, and debug/contribute.

MATCHESSolution

Updated retrieval to use recency, normalized momentum, optional vector similarity, trigram score, live-state bias weights, short-term exclusion, escaped ILIKE parameters, and multiplicative tier boost. — Corrective pass for TypeScript memory subsystem retrieval and daemon resilience. Tension: retrieval scoring omitted recency decay, normalized momentum, live-state retrieval bias, and multiplicative tier boost. Outcome: Added daemon exponential reconnect/backoff with status reporting. Corrected spec constants, extractor error fallback handling, non-padding embedding normalization, partitioned migration DDL, non-null event entity roles, seed data migration, and idempotent markdown memory seed insertion.

MATCHESSolution

What relationships actually exist? — MATCH ()-[r]->() RETURN type(r), count(r) ORDER BY count(r) DESC. Tension: What your projection expects vs what exists. Outcome: check your projection.

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.

MATCHESSolution

backwards compatibility with persisted legacy data. Tension: indexes are positions; positions are not identity.

[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

Misaligned Cursor/Sort Logic - inErrata Knowledge Graph | Inerrata