Hi Gilles,
This is possible throuh a dichotomous algorithm that is very fast, even with
64 000 lines per list ...
I'm not sure what a dichotomous algorithm really means. The performance may
be quite acceptable if everything is on the local hard drive of a PC.
However, as soon as a network is involved (for example, a split multiuser
database, with the BE on a file server), the performance might be painfully
slow.
Tom
http://www.access.qbuilt.com/html/expert_contributors.html
http://www.access.qbuilt.com/html/search.html
__________________________________________
:
Thank you for your answer.
My application is a dictionary, it's why I have so many lines. I need to be
able to browse through the listboxes of my application, so I'm not sure I can
load repeatedly a subset of records. Moreover, I have a lot of lists
containing diferent items (French word, Icelandic word, etymology, and so on,
and each of these lists is used in several parts of my application to help me
input data in textboxes (traduction or ethymology of a word for instance).
This is possible throuh a dichotomous algorithm that is very fast, even with
64 000 lines per list ... unless I have to load repeatedly a subset of those
lines. I will first study better your ideas, and next I will see.
Bye.