That is a primo idea.

Of course, you could also b-tree (sorta) it where you populate an array with every n records, n being equal to INT(number of records/65000)+1. Then you ASCAN the value and if not directly found, regress unitl find. When found, if not directly found you scan the next "n" records in the table to find the exact match ... logical record number = (n/2)+1+number of records scanned.

>>That is an excellent ideal. However, I think arrays are limited to 65,000 records, and I don't think it would work if I hit the pgdn or pgup key.
>
>well, skiping 5/10 records forward from the last record you were on is still better that skipping 50000 records from the top of the file
>as for the the 65000 limit of arrays - using an array poperty and assign/access method you can create a "virtual" array that consists of multiple arrays also it may be enough to store just the current visible options
>
>Arnon