Xref: utzoo comp.lang.pascal:2681 comp.misc:7372
Path: utzoo!utgpu!utstat!jarvis.csri.toronto.edu!rutgers!cmcl2!nrl-cmf!think!gem.mps.ohio-state.edu!brutus.cs.uiuc.edu!psuvax1!wuarchive!texbell!vector!attctc!rcj
From: rcj@attctc.Dallas.TX.US (Robert Johnson)
Newsgroups: comp.lang.pascal,comp.misc
Subject: Global Searching Algorithm Needed
Message-ID: <10213@attctc.Dallas.TX.US>
Date: 16 Nov 89 03:32:34 GMT
Followup-To: comp.lang.pascal
Organization: The Unix(R) Connection, Dallas, Texas
Lines: 18

I am in need of an efficiant global searching algorith, preferably in
pascal, but simply a good method of opperations would be appreciated.
What I mean by a 'global searching alogorithm' is what free form 
databases (i.e. Broderbund's MemoryMate [great program, BTW]) use to search
through uncorrolated free form data to find the key.  If I am making any
sense at all (I doubt it, I know what I'm talking about though, just
not how to do it!), then I would really appreciate some pointers.

         Thanks,
             Robert C. Johnson

 

-- 
|  Robert C. Johnson                |  "Minds are like parachutes.       |
|   rcj@attctc.dallas.tx.us         |   They only function when they are |
|   (214) 357-5306                  |   Open."  -Sir James Dewar         |