Knex.js pagination performance for deep offset queries

Implementing pagination in Knex.js typically involves the use of .limit() and .offset() to slice datasets at the database level. To maintain deterministic results, these methods are paired with .orderBy().

When dealing with large datasets, there is a known performance trade-off regarding deep paging. As the offset value increases, the database engine must scan through all preceding rows before returning the requested window, which can lead to significant latency in production environments.

Given these constraints, what are the recommended strategies within Knex.js to avoid the performance decay associated with high offset values? Is there a standard pattern for implementing keyset pagination (cursor-based) using the Knex query builder to replace offset-based slicing?