That would depend on how many records are selected in the first phase, right? I suspect that if many records are selected in the first phase, it might get quite slow. I believe you have managed to avoid this.
I think that creating a single query with a combined condition would be still faster, but quite often, it is better to do whatever is fastest to
program.
>No, on the contrary, it's very fast! Notice that the first search is fully optimized, and the next searches are done in RAM. In my case I have a table with about 6 million records, and the search is always immidiate. In reality the total speed depends on how many records you get in the first SELECT. In my system I have a function to sort the laCondition array so the longest condition is in the first element, since this condition normally will get fewest records which is a plus.
Difference in opinions hath cost many millions of lives: for instance, whether flesh be bread, or bread be flesh; whether whistling be a vice or a virtue; whether it be better to kiss a post, or throw it into the fire... (from Gulliver's Travels)
