Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!tellab5!chinet!dhartung From: dhartung@chinet.chi.il.us (Dan Hartung) Newsgroups: comp.databases Subject: Re: The Rushmore Technology from FoxPro Message-ID: <1991Jun09.215527.10286@chinet.chi.il.us> Date: 9 Jun 91 21:55:27 GMT References: <25921@gremlin.nrtc.northrop.com> Organization: Chinet - Chicago Public Access UNIX Lines: 20 tarjeij@ulrik.uio.no (Tarjei Jensen) writes: >Is it the speed associated with finding out whether a record can be found or >not? No. Since SEEKs already operate virtually instantaneously, what this does is apply index usage to commands that previously would have done a physical record-by-record search. For instance, if you know the first word of a company name is "Smith" of "Smith & Jones" you can just SEEK &string where string="Smith" and up comes your record. On the other hand if you only knew "Jones" you had to do LOCATE FOR &jones$comp.name which would take quite a while. Under RushMore it's as fast as SEEK. If you have complex queries, every field that has an index available will be optimizable. No index, no optimization. -- Daniel A. Hartung | "What's the difference anyway, between being dhartung@chinet.chi.il.us | safe and being rad, the joke's on us, we've Birch Grove Software | all been had." -- John Wesley Harding -----------FoxPro Programmer Looking For Work--------------