home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.databases.theory
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!darwin.sura.net!Sirius.dfn.de!Urmel.Informatik.RWTH-Aachen.DE!ulysses!meskes
- From: meskes@ulysses.informatik.rwth-aachen.de (Michael Meskes)
- Subject: Re: Any example of actual implementations of B-Tree's?
- Message-ID: <meskes.712573610@ulysses>
- Sender: news@Urmel.Informatik.RWTH-Aachen.DE (Newsfiles Owner)
- Nntp-Posting-Host: ulysses
- Organization: Rechnerbetrieb Informatik / RWTH Aachen
- References: <1992Jul30.175243.9569@usenet.ins.cwru.edu> <chaw.712522251@Xenon.Stanford.EDU>
- Date: 31 Jul 92 09:06:50 GMT
- Lines: 35
-
- In <chaw.712522251@Xenon.Stanford.EDU> chaw@Xenon.Stanford.EDU (S. S. Chawathe)
- writes:
-
- >al045@cleveland.Freenet.Edu (Gergely Tapolyai) writes:
- >>B in B-Tree _is_ for Binary. B-Tree, B+ tree, Bit-Tree and their
-
- >That's strange, considering that a B-Tree is not binary at all!
-
- agreed
-
- >I remember hearing strange tales about the B standing for the
- >name of one of the inventors, who was working at Boeing....etc.
- >:-)
-
- Yes, one possible interpretation is the name of one of the inventors, who was
- R. Bayer, a professor from Munich, Germany, cf. the following article:
-
- Bayer R. and E.M. McCreight, "Organization of operating on B-Trees",
- Acta Informatica 9:1, 1972, pp 173 - 189
-
- Mostly, especially in english language literature, it is said that the B is
- standing for Balanced.
-
- In the original article there was also literature searched, that describes the
- implementation, if I remember right. Try to use
-
- Nicklaus Wirth
- Algorithms + Data Structures = Programs
- Prentice Hall
-
- Michael
- --
- Michael Meskes, Lehrstuhl fuer angewandte Mathematik insb. Informatik,
- RWTH-Aachen, Ahornstr. 55, D-W-5100 Aachen
- Email: meskes@ulysses.informatik.rwth-aachen.de
-