Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> B-Tree's and internal DBMS implementations

B-Tree's and internal DBMS implementations

From: John <JonJones(NOSPAM)_at_hotmail.com>
Date: Tue, 31 Dec 2002 02:31:23 -0000
Message-ID: <auqvhv$3ng$1@news8.svr.pol.co.uk> 





Hi all.



I'am somewhat curious about the B-tree algorithms and how RDBMS us them
successfully. My question is, what is stored at the leaf level? is it memory
addresses for the set that matches a point query? I assume a relation that
has 3 indexes would have 3 corresponding B-trees for each of the indexes?



How does the B-Tree deal with the LIKE clause, does that then cause a linear
search through the tree?



Thanks, Jon
Received on Mon Dec 30 2002 - 20:31:23 CST












Original text of this message













  HOME |
  ASK QUESTION |
  ADD INFO |
  SEARCH |
  E-MAIL US