Are you talking about MySQL? Because I have an SQL Server stored procedure that uses OFFSET and FETCH NEXT to browse through a 500K-row table and the execution time is stable throughout the table.
I'm using PostgreSQL and no stored procedures. That's awesome that MySQL can do that!
Sorry for the confusion. I'm using SQL Server, and yes, it seems correctly optimized for this situation.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Are you talking about MySQL?
Because I have an SQL Server stored procedure that uses OFFSET and FETCH NEXT to browse through a 500K-row table and the execution time is stable throughout the table.
I'm using PostgreSQL and no stored procedures. That's awesome that MySQL can do that!
Sorry for the confusion. I'm using SQL Server, and yes, it seems correctly optimized for this situation.