John,

>I am developing an application (part of TTS) that convert letters to relevant phonemes for final year project. Some exception words may be stored in database. My supervisor asks me to use binary search to faster the searching. However, since i am using VFP....I suppose binary search is not useful. I would like prove to my supervisor that FP database engine will much faster than binary search by programming.

>Anybody got any experience with it....and may provide certain test result that can prove FP engine is faster?

I presume you mean searchin within a binary tree for a certain value, don't you ?
If so, Yes, VFP (or FP 2.x for that matter) will be faster if you have the proper indexes for your search. If the engine can use indexes (which are constructed on the B-tree principle) to find matches it will be much faster than implementing a kind a B-tree searching engine as the VFP is tuned for performance and very advanced queries.

Walter,