Mario, I went back and read your draft about result sorting and paging, because I am looking to implement paging in our RDAP server. But I have a comment: It seems like some of these operations will not scale well. For instance, the count parameter will cause the database to do something like an SQL SELECT COUNT(*) operation. That generally results in a scan through the table (or at least an index), I think.
Likewise, paging by means of an offset, as you suggest, might result in scanning through the result set from the start each time a new page is requested. Might it be more efficient to have the server return, using your clever link technique, some sort of cursor value indicating the start of the next page? Of course, if an implementer wanted the cursor to be the index of the next row in the result set, it could pass the offset as the cursor token, but by defining the cursor to be an opaque string without defined meaning, you would not lock in all implementers to that scheme. Thanks. Regards, Brian
_______________________________________________ regext mailing list [email protected] https://www.ietf.org/mailman/listinfo/regext
