A wise person once told me that the cost of retrieving a page in a large result set increased linearly with page number: the further you advanced into the result set, the higher the cost per page. She was talking about pages defined in the SQL with OFFSET and FETCH.
Under the hood, ADO also does paging, returning an IEnumerable to the application code, buffering a partial result set, fetching pages successively as needed.
Do these ADO pages work the same way? Specifically, does the cost increase as you advance into the result set? Is this described somewhere? Everything I know about optimisation applies to the query as a whole, not the course of its execution.