Phrase matching is not the same as "and" matching.
Agreed. Sorry if implied otherwise. But once you have a list of the records that contain all the terms, then validating these against the original phrase is considerably less costly than searching the whole 20MB.
Good point. Using index on the keys of the hash does make more sense.
In reply to Re: Re: Re: Re: Re: Re: Re: speeding up a file-based text search
by BrowserUk
in thread speeding up a file-based text search
by perrin
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |