How can I efficiently paginate large result sets using LIMIT and OFFSET in PostgreSQL while ensuring consistent ordering?

I need to retrieve pages of data from a very large table without scanning the entire dataset on each request. The goal is to bound the query so that only the required subset of rows is processed, while keeping response times predictable.

I plan to use the LIMIT and OFFSET clauses (or their MongoDB equivalents) to implement pagination, but I am uncertain about the performance impact of large OFFSET values and how to guarantee a stable order when concurrent modifications occur. I also wonder whether keyset pagination would be a better fit for my workload.

What are the performance implications of using large OFFSET values? How can I guarantee stable ordering when data changes between pages? Is keyset pagination a more efficient alternative for my scenario?