2 ms·
Use a sorted index (e.g. Btree), and use those values to quickly find the start of the next page of results. For good performance this also requires that your
by paulddraper 3y ago
Use a sorted index (e.g. Btree), and use those values to quickly find the start of the next page of results.
For good performance this also requires that your search criteria (if any) be compatible with this index.