Path: utzoo!attcan!uunet!snorkelwacker!usc!elroy.jpl.nasa.gov!ucla-cs!ravi
From: ravi@maui.cs.ucla.edu (T.M Ravi)
Newsgroups: comp.databases
Subject: Index Managers and B+ trees
Message-ID: <33095@shemp.CS.UCLA.EDU>
Date: 16 Mar 90 18:51:57 GMT
Sender: news@CS.UCLA.EDU
Reply-To: ravi@maui.cs.ucla.edu (T.M Ravi)
Organization: UCLA Computer Science Department
Lines: 14


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. 

I would welcome any information, papers or references on the implementation
of an index manager. Particularly issues such as key compression, interface
to the index manager, pre-allocation of pages etc. 

Thanks

ravi 
ravi@cs.ucla.edu