Hello.
mysql_store_result stores the result set in a linked list (for memory
efficiency). With older versions mysql_data_seek always starts from
the beginning of the list and therefore has an O(n) complexity even
for sequential traversal.
IIRC, this was fixed with newer MySQL client libs, you ei
I have been bench-marking an in-house higher-level library to access the
MySQL database which uses the store_result and data_seek functions to
provide random access to records in a selected dataset.
This has brought to light that for 'large' result sets over 10,000 records,
the data_seek is s
