Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!caip!topaz!ll-xn!nike!lll-crg!seismo!munnari!moncskermit!basser!anucsd!csadfa!rap
From: rap@csadfa.cs.adfa.oz
Newsgroups: net.database
Subject: Re: Speeds of DBMS and Benchmark Claims
Message-ID: <581@csadfa.cs.adfa.oz>
Date: Mon, 18-Aug-86 14:51:49 EDT
Article-I.D.: csadfa.581
Posted: Mon Aug 18 14:51:49 1986
Date-Received: Thu, 28-Aug-86 02:29:50 EDT
References: <580@csadfa.cs.adfa.oz>
Organization: Dept. Computer Science, University College, UNSW, ADFA, Canberra, Australia.
Lines: 18


	sorry but some lines seem to have been lost in the mail from
	my last message.
	The beginning was: Several people have commented that relational
databases have been improving in performance. I do not know how this has
been accomplished.
	 	My understanding of B tree variants seems to be out of
> date. Can Anyone give me a good recent reference. I would also like one 
> suitable for a second year course on file structures,or another course here
> on DBMS ( also second year; it follows the file structure course.
 I am also interested in the consequences of filling the directories 
> to 2/3 instead of 1/2( Minimum)
 Robert  Pearson		 ISD:	+61 62 68 8171  STD: (062) 68 8155
 Dept. Computer Science		 Telex:	ADFADM AA62030
 University College	      ACSNET:	rap@csadfa.oz
 Aust. Defence Force Academy	UUCP:	...!seismo!munnari!csadfa.oz!rap
 Canberra. ACT. 2600.		ARPA:	rap%csadfa.oz@SEISMO.CSS.GOV
 AUSTRALIA		       CSNET:	rap@csadfa.oz