http://www.softwarememories.com/2008/10/02/a-bit-of-db2-history-per-ibm/ History of software, by somebody who lived it Fri, 30 Jul 2010 14:36:06 -0400 http://wordpress.org/?v=2.8.4 hourly 1 http://www.softwarememories.com/2008/10/02/a-bit-of-db2-history-per-ibm/#comment-45794 Roger Miller Fri, 25 Jun 2010 18:04:08 +0000 http://www.softwarememories.com/?p=35#comment-45794 Wikipedia has a good explanation, as B has been used for balanced, Bayer, broad, bushy, or Boeing. Binary is not the structure used for indexing, where fast fanout is crucial. http://en.wikipedia.org/wiki/B-tree Wikipedia has a good explanation, as B has been used for balanced, Bayer, broad, bushy, or Boeing. Binary is not the structure used for indexing, where fast fanout is crucial.
http://en.wikipedia.org/wiki/B-tree

]]> http://www.softwarememories.com/2008/10/02/a-bit-of-db2-history-per-ibm/#comment-42029 Gopi Nathan Mon, 16 Nov 2009 13:25:56 +0000 http://www.softwarememories.com/?p=35#comment-42029 Rudolf Bayer (born 7 May 1939) has been Professor (emeritus) of Informatics at the Technical University of Munich since 1972. He is famous for inventing two data sorting structures: the B-tree with Edward M. McCreight, and later the UB-tree with Volker Markl. Rudolf Bayer (born 7 May 1939) has been Professor (emeritus) of Informatics at the Technical University of Munich since 1972. He is famous for inventing two data sorting structures: the B-tree with Edward M. McCreight, and later the UB-tree with Volker Markl.

]]> http://www.softwarememories.com/2008/10/02/a-bit-of-db2-history-per-ibm/#comment-32032 Jay Wortman Sun, 05 Oct 2008 21:02:47 +0000 http://www.softwarememories.com/?p=35#comment-32032 One comment with databases and especially relational databases. It is about indexes, particularly the B-tree or b*-tree indexes. I think it was about 1970 I heard an IBM researcher with the last name of Bayer talk at a conference about his B-tree indexes. I thought that the name for derived from Bayer but others may say it comes from Binary. Anyway, Bayer was a mathematician and his work is responsible for the development of the B-Tree indexes. Relational DBMS' would be very different without them. IBM was probably one of the first, if not the first, to implement these indexes. One comment with databases and especially relational databases. It is about indexes, particularly the B-tree or b*-tree indexes. I think it was about 1970 I heard an IBM researcher with the last name of Bayer talk at a conference about his B-tree indexes. I thought that the name for derived from Bayer but others may say it comes from Binary. Anyway, Bayer was a mathematician and his work is responsible for the development of the B-Tree indexes. Relational DBMS’ would be very different without them. IBM was probably one of the first, if not the first, to implement these indexes.

]]>