On Tue, May 21, 2002 at 08:09:36AM -0400, Nick Stuart wrote:
> Ok, so know you got me interested. What exactly are R-Trees.
http://www.google.com/search?hl=en&q=r-tree
:-)
Jeremy
--
Jeremy D. Zawodny, <[EMAIL PROTECTED]>
Technical Yahoo - Yahoo Finance
Desk: (408) 349-7878 Fax: (408) 349-54
PROTECTED]
- Original Message -
From: "Nick Stuart" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]>
Sent: Tuesday, May 21, 2002 3:09 PM
Subject: Re: MyISAM internal algorithms
> Ok, so know you got me interested. What exactly are R-Trees. I
Ok, so know you got me interested. What exactly are R-Trees. I know the
structure of B trees, hadto program a small version of a B' tree before, but never
heard of an R-Tree.
Any explanation
or link to where I might find some info would be appreciated.
-Nick
> On Mon, May 20, 2002
at 09:39:52AM
On Mon, May 20, 2002 at 09:39:52AM -0600, Andrei Cojocaru wrote:
>
> I believe mySQL uses B-Trees (not binary trees), that's about all I
> know :)
Right. The indexes are B-Tree structures (until R-Trees appear in
4.1, of course).
Jeremy
--
Jeremy D. Zawodny | Perl, Web, MySQL, Linux Magaz
I believe mySQL uses B-Trees (not binary trees), that's about all I know :)
Andrei Cojocaru
[EMAIL PROTECTED]
- Original Message -
From: "Jan Peuker" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, May 20, 2002 2:59 AM
Subject: MyISAM internal algorithms
> Hi MySQL-Team,
>
