How does LINQ impact scalability of pagination strategies in distributed databases?

LINQ pagination using Skip/Take becomes inefficient at scale due to database scanning overhead.

In distributed or sharded databases, Skip requires scanning and discarding rows before returning results. As offsets grow, performance degrades. LINQ translates Skip/Take into SQL OFFSET/FETCH, which is inefficient for large datasets. Keyset pagination (using last seen ID or timestamp) is more scalable but requires manual query design.