Re: search for non-unique question

This WebDNA talk-list message is from

2001

It keeps the original formatting. numero = 40287
interpreted = N
texte = actually it can be up to 10k times 10k iterations :-)This search within search is the thing you need, Dale, however, I would puta max=1 in the INNER search, which would give you only one output fornicknames that are in there multiple times!Ciao,Peter----- Original Message -----From: Aaron Lynch To: WebCatalog Talk Sent: Sunday, November 25, 2001 11:39 AMSubject: Re: search for non-unique question> On a db with 10k records, wouldn't this be 20k searches? :)>>> On 11/24/01 8:59 PM, Marc@lsaproofing.com mashed the following keys :>> > This should work, although it is a nasty search as it will have tosearch> > the db 10,000 times less the blanks:> >> > [!]---------Search for all nicknames--------[/!]> > [Search db=your_users.db&nenicknamedata=findall&nenicknamedata=[blank]]> > [founditems]> > [!]---------Then take each nickname to research for numfound greaterthan> > one--------[/!]> > [Search> >db=your_users.db&eqnicknamedata=[nickname]&nicknamesort=1&nicknamesdir=as]> > [showif [numfound]>1]> > [founditems]> > [!]---------If more than one nickname is found it will display withinthe> > showif --------[/!]> > [nickname]
> > [/founditems]> > [/showif]> > [/search]> >> > [/founditems]> > [/search]> >> >> >> >> >> > On 11/24/01 3:54 AM, Dale Therio wrote:> >> >> WebCatalog 3.0.7 on Mac OS> >>> >> Hello,> >>> >> I have a database with about 10,000 records in it. I need to> >> do a search on a specific field (nickname) and find all> >> records that have more than one match.> >>> >> What I am doing is trying to take an existing field and> >> eventually make the value in that field a unique value, so in> >> order to do that I need to find all records where there is a> >> conflict and notify those users that they will need to change> >> their nickname.> >>> >> Got any ideas on how to construct such a search?> >>> >> Oh, and many of the records currently have this field blank, I> >> will deal with those users as a seperate case.> >>> >> Thanks for any suggestions.> >>> >> Dale> >>> >>> >> -------------------------------------------------------------> >> This message is sent to you because you are subscribed to> >> the mailing list .> >> To unsubscribe, E-mail to: > >> To switch to the DIGEST mode, E-mail to> >> > >> Web Archive of this list is at: http://search.smithmicro.com/> >> >> > -------------------------------------------------------------> > This message is sent to you because you are subscribed to> > the mailing list .> > To unsubscribe, E-mail to: > > To switch to the DIGEST mode, E-mail to> > > > Web Archive of this list is at: http://search.smithmicro.com/>>> -------------------------------------------------------------> This message is sent to you because you are subscribed to> the mailing list .> To unsubscribe, E-mail to: > To switch to the DIGEST mode, E-mail to> Web Archive of this list is at: http://search.smithmicro.com/>-------------------------------------------------------------This message is sent to you because you are subscribed to the mailing list .To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to Web Archive of this list is at: http://search.smithmicro.com/ Associated Messages, from the most recent to the oldest:

Re: search for non-unique question (Brian Fries 2001) Re: search for non-unique question (Aaron Lynch 2001) Re: search for non-unique question (Brian Fries 2001) Re: search for non-unique question (Peter Werno 2001) Re: search for non-unique question (Dale Therio 2001) Re: search for non-unique question (Aaron Lynch 2001) Re: search for non-unique question (Marc@lsaproofing.com 2001) Re: search for non-unique question (Aaron Lynch 2001) search for non-unique question (Dale Therio 2001)

actually it can be up to 10k times 10k iterations :-)This search within search is the thing you need, Dale, however, I would puta max=1 in the INNER search, which would give you only one output fornicknames that are in there multiple times!Ciao,Peter----- Original Message -----From: Aaron Lynch To: WebCatalog Talk Sent: Sunday, November 25, 2001 11:39 AMSubject: Re: search for non-unique question> On a db with 10k records, wouldn't this be 20k searches? :)>>> On 11/24/01 8:59 PM, Marc@lsaproofing.com mashed the following keys :>> > This should work, although it is a nasty search as it will have tosearch> > the db 10,000 times less the blanks:> >> > [!]---------Search for all nicknames--------[/!]> > [Search db=your_users.db&nenicknamedata=findall&nenicknamedata=[blank]]> > [founditems]> > [!]---------Then take each nickname to research for numfound greaterthan> > one--------[/!]> > [Search> >db=your_users.db&eqnicknamedata=[nickname]&nicknamesort=1&nicknamesdir=as]> > [showif [numfound]>1]> > [founditems]> > [!]---------If more than one nickname is found it will display withinthe> > showif --------[/!]> > [nickname]
> > [/founditems]> > [/showif]> > [/search]> >> > [/founditems]> > [/search]> >> >> >> >> >> > On 11/24/01 3:54 AM, Dale Therio wrote:> >> >> WebCatalog 3.0.7 on Mac OS> >>> >> Hello,> >>> >> I have a database with about 10,000 records in it. I need to> >> do a search on a specific field (nickname) and find all> >> records that have more than one match.> >>> >> What I am doing is trying to take an existing field and> >> eventually make the value in that field a unique value, so in> >> order to do that I need to find all records where there is a> >> conflict and notify those users that they will need to change> >> their nickname.> >>> >> Got any ideas on how to construct such a search?> >>> >> Oh, and many of the records currently have this field blank, I> >> will deal with those users as a seperate case.> >>> >> Thanks for any suggestions.> >>> >> Dale> >>> >>> >> -------------------------------------------------------------> >> This message is sent to you because you are subscribed to> >> the mailing list .> >> To unsubscribe, E-mail to: > >> To switch to the DIGEST mode, E-mail to> >> > >> Web Archive of this list is at: http://search.smithmicro.com/> >> >> > -------------------------------------------------------------> > This message is sent to you because you are subscribed to> > the mailing list .> > To unsubscribe, E-mail to: > > To switch to the DIGEST mode, E-mail to> > > > Web Archive of this list is at: http://search.smithmicro.com/>>> -------------------------------------------------------------> This message is sent to you because you are subscribed to> the mailing list .> To unsubscribe, E-mail to: > To switch to the DIGEST mode, E-mail to> Web Archive of this list is at: http://search.smithmicro.com/>-------------------------------------------------------------This message is sent to you because you are subscribed to the mailing list .To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to Web Archive of this list is at: http://search.smithmicro.com/ Peter Werno

DOWNLOAD WEBDNA NOW!

Top Articles:

Talk List

The WebDNA community talk-list is the best place to get some help: several hundred extremely proficient programmers with an excellent knowledge of WebDNA and an excellent spirit will deliver all the tips and tricks you can imagine...

Related Readings:

Frames and WebCat (1997) Speeding up my [showif] performance (1999) Searching with a form (2000) [showif] question (2000) IE-caching (1998) Mac: LModelDirector bug fix (1997) RE: Error -108 (1997) Help name our technology! (1997) [CART] inside a [LOOP] (1997) passwords not working (2000) How to remove comments with grep? (2003) [WebDNA] Corrupted Db that Table-Search other db's (2011) math on date? (1997) [Webcat 2]Next (1997) WebCatalog 2.0 b 15 mac (1997) Balancing randomness (2000) [OT] HTML EMAIL program wanted (1999) WC2f3 (1997) Great product and great job ! (1997) (2000)