sql-query-conventions

To prevent N+1 queries in ORM list calls, replace per-item async fetch loops with batched access, joins, or server-side aggregation. This avoids expensive round-trips and ensures your data access scales efficiently as your data volume grows.

To implement stable pagination in SQL SELECT queries, use deterministic ORDER BY clauses alongside explicit LIMITs with validated page sizes. This combination prevents unbounded reads and avoids paging bugs when users navigate through large datasets.

You should avoid SELECT * and use explicit column selection to reduce bandwidth over-fetching and limit coupling to schema growth. Specifying exact columns ensures your queries remain correct and performant even when the database schema expands.

Yes, it works directly with PostgREST .from() and .select() chains by applying the same read-path conventions. It enforces explicit limits, stable ordering, and batched access to prevent inefficient data-access patterns in your PostgREST queries.

Relying on ORMs for query optimization can lead to unbounded reads, unstable pagination, and N+1 round-trips if not explicitly constrained. You must enforce explicit LIMITs, deterministic ordering, and column selection to avoid these slow and costly data-access patterns.