B-Tree's and internal DBMS implementations

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 Tue Dec 31 2002 - 03:31:23 CET