Re: Theoretically best search algorihtms
Date: 2000/01/18
Message-ID: <38849506.1404849_at_news.demon.co.uk>#1/1
Thomas, since you are asking about SQL RDBMSs, you probably don't
really want to know the search algorithm (programming method applied)
so much as the most efficient SQL structure - since the algorithm will
be built into the RDBMS and you can't change it.
AFAIK, the Rushmore algorithms are pretty much the fastest and are
used in a lot of RDBMSs, including MS SQL Server, FoxPro and Access as
well as (I think) InterBase and DB2.
If that *is* what you were after, great. Otherwise, could clarify what
you want to know?
On Sun, 16 Jan 2000 21:19:12 +0100, Thomas-Milius
<Thomas-Milius_at_t-online.de> wrote:
[snip]
>If you have datasets inside a DB with datafields and you
>want to search your sets by the contents of one or more
>fields (eg SELECT ... WHERE ...). What are the best known
>algorithms to do such a search in a fast way? Solution
[snip]
-- Mark A Preston BSc, FIAP Business Manager, MicroFix Systems Solutions mark_at_mpreston.demon.co.ukReceived on Tue Jan 18 2000 - 00:00:00 CET