B+Tree vs. B*Tree

This may be a little off-topic, but, what are the differences between B+tree indexes, and B*tree indexes? At school I had to write a program to perform insert and update on a B+tree index, so I'm familiar with that type of index. Searching for B*tree on Google is less than effective as Google strips out the * character.

Any docs you could point me to would be helpful. I have the Silberschatz book mentioned previously today, which covers B-tree, and B+tree indexes, but not b*tree indexes.

Thanks,

• Dan

  ---

  Daniel Hanks - Systems/Database Administrator About Inc., Web Services Division

  ---

  ---

  Please see the official ORACLE-L FAQ: http://www.orafaq.com

  ---

  To unsubscribe send email to: oracle-l-request_at_freelists.org put 'unsubscribe' in the subject line.
  --
  Archives are at http://www.freelists.org/archives/oracle-l/ FAQ is at http://www.freelists.org/help/fom-serve/cache/1.html

  ---