Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!ames!haven!decuac!mountn.dec.com!labc!wallis
From: wallis@labc.dec.com (Barry L. Wallis)
Newsgroups: comp.databases
Subject: What is a B+ tree? (was Re: Index Managers and B+ trees)
Keywords: B tree, B+ tree
Message-ID: <1467@mountn.dec.com>
Date: 17 Mar 90 19:31:48 GMT
Sender: news@mountn.dec.com
Organization: Digital Equipment Corporation
Lines: 18


In article <33095@shemp.CS.UCLA.EDU>, ravi@maui.cs.ucla.edu (T.M Ravi) writes...
> 
>I remember seeing a bunch of messages a few months back about B/B+ trees. 
>We already have the design of locking and transaction and buffer management
>worked out and are trying to design a traditional high performance index
>manager using B+ trees. 
> 

This brings up a question that I've wondered about from time to time (bit never
for very long ;-) ). What is the difference between a B tree and a B+ tree?

---
Barry L. Wallis			USENET: wallis@labc.dec.com
Database Consultant		Prodigy (don't laugh): DNMX41A
U.S. DECtp Resource Center	DECUServe: EISNER::WALLIS (not on the net yet)
Los Angeles, CA			"No one voted for me, I represent myself"
---