Rushmore also falls over in a screaming heap on complex queries - where it
succeeds is with simple stuff, which is MSAccess' market, that you can do
with a visual query builder.
Where Rushmore is nice, or MSAccess really, is that you can do a series of
simple cascaded queries (on-the-fly-views) that Rushmore makes really fast.
Max
-----Original Message-----
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Paul Heinz
Sent: Monday, 1 November 1999 17:30
To: Multiple recipients of list database
Subject: RE: [DUG-DB]: Rushmore optimisation (was Interbase Performance)
Patrick asked:
> Anyone have thoughts about Rushmore optimisation - is this proprietary to
> MS, are similar algorithms supported by other suppliers, or what?
My understanding is that for all the fancy talk, Rushmore essentially boils
down to the use of bitmap indexes.
InterBase (and likely many other SQL engines) have used bitmap index
techniques for quite some time. I'd expect it to be a fairly standard query
optimisation technique.
It just took a while for the PC database/dBase world to get their hands on
engines that used it.
TTFN,
Paul.
---------------------------------------------------------------------------
New Zealand Delphi Users group - Database List - [EMAIL PROTECTED]
Website: http://www.delphi.org.nz
---------------------------------------------------------------------------
New Zealand Delphi Users group - Database List - [EMAIL PROTECTED]
Website: http://www.delphi.org.nz
