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,
>
> my question is about MySQL(which means MyISAM) internal sorting/storeing
> algorithms. I found some hints in the manual ("How MySQL " ... e.g. "store
> tables"), but not exactly what I want. I don't need any exact information
or
> code fragments (I fell down my chair when I took a first look to the
> source), it's just a point of my interest how MySQL manages datasets. One
of
> my professionals told me that it would have something to do with
> B-(2-3-4)-Trees that are the best solution for reading blocks from disks,
> and that indexes would be stored in Binary-sorted-Trees or Tries. Do you
> have any short description of this for me?
> Thanks a lot,
>
> Jan Peuker
>
>
> ---------------------------------------------------------------------
> Before posting, please check:
> http://www.mysql.com/manual.php (the manual)
> http://lists.mysql.com/ (the list archive)
>
> To request this thread, e-mail <[EMAIL PROTECTED]>
> To unsubscribe, e-mail
<[EMAIL PROTECTED]>
> Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
>
>
---------------------------------------------------------------------
Before posting, please check:
http://www.mysql.com/manual.php (the manual)
http://lists.mysql.com/ (the list archive)
To request this thread, e-mail <[EMAIL PROTECTED]>
To unsubscribe, e-mail <[EMAIL PROTECTED]>
Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
