Fuzzy Browse Speed

[Howard Wolowitz]

----- Original Message ----- 
From: "Nancy Palmquist" <nlp at vss3.com>
To: "filePro List" <filepro-list at lists.celestial.com>
Sent: Friday, February 16, 2007 3:20 PM
Subject: Fuzzy Browse Speed


>I was wondering if anyone had a trick to offer to make the Browse Lookup
> that is using a Fuzzy Search finish any faster.
>
> I am searching a file that fundementally has a STATE & City field.  I
> want to find a city  that matches my input, in the state I indicated.
>
> So I enter a CSTATE code, then I enter a CITY.
>
> I run a lookup  like this:
>
> kk=CITY
>
> 
>   -------   -   -   -   -   -   -   -   -   -   -   -   -   -   -   -   -
>       ◄ If:
>       Then: lookup card = cardfile  Z=49   K=kk   -n b="(brw=12,9,-1
> fuzzy=20 xkey=X show=pkeep pop=2 prc=matchst fill=asc)[City/Ent
> 53  -------   -   -   -   -   -   -   -   -   -   -   -   -   -   -    -
>       ◄ If:
>       Then: ity                     Payto                OLD CITY]*49
>                            *3                   *1"
> 54  -------   -   -   -   -   -   -   -   -   -   -   -   -   -   -    -
>    [These lines do what happens if I pick something or don't pick
> something]
>
>
>  58  -------   -   -   -   -   -   -
> matst  ◄ If: cstate ne card(48)
>        Then: drop
>  59  -------   -   -   -   -   -   -
>        ◄ If:
>        Then: end
>  60  -------   -   -   -   -   -   -
>
>
> I tried DROP ALL and DROP ALL AFTER - but a fuzzy search works by record
> and I think it does not understand these options.
>
> Anyone got an idea.
>
> Nancy
> -- 
> Nancy Palmquist MOS & filePro Training Available
> Virtual Software Systems Web Based Training and Consulting
> PHONE: (412) 835-9417    Web site:  http://www.vss3.com

Remember Nancy, a fuzzy search has to read every record to find the best 
matches.  That said, it may be faster if you create a new field and populate 
it with the city, a space and the state.  Build an index on the new field 
and then use that index in the search.

Just a guess.

Howie