A bit of DB2 history, per IBM
I meant to put up a longer post some months back, reproducing some of the 25th anniversary DB2 history IBM provided, courtesy of Jeff Jones and his team. Seems I didn’t get around to it. Maybe later.
Anyhow, I ran across the following concise info, from a January, 2003 web page posted by (who else?) Jeff Jones:
A series of research projects have been a steady source of technology for the DB2 family since the beginning:
- The System R project resulted in the first IBM implementation of the relational model. A project called ARIES delivered row-level locking technology used throughout the database industry today.
- Cost-based query optimization has been an area of intense effort and innovation ever since the System R days. The R Star project extended the relational model to distributed system environments.
- The Starburst project focused on making the relational model extensible to handle new forms of information and new kinds of optimization strategies.
- The Garlic project brought an emphasis on data federation, allowing data in diverse systems, not just DB2 systems, to be managed together.
- Most recently, a technical preview based on DB2 has demonstrated the integration of information from Web services and the use of XQuery as an additional and powerful query language for managing XML content.
The first implementation of relational technologies from the initial System R project was the database integrated into the System/38 server in 1980. In 1982, the SQL/DSTM product was delivered on the mainframe operating systems VM and VSE, also based on System R. DB2, formally called DATABASE 2, was born in 1983 on MVSTM. The database manager in OS/2® Extended Edition in 1987 was the first relational database on distributed systems. SQL/400® for the new AS/400® server emerged in 1988. New DB2 editions were delivered on AIX® (1993), HP-UX and Solaris (1994), Windows® (1995), and Linux (1999).
Comments
5 Responses to “A bit of DB2 history, per IBM”
Leave a Reply
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.
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.
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
[…] serious about Streams, as one would expect from an effort whose code name so cheekily references System R. In particular, Streams shows up prominently on IBM’s top-level analytic architecture […]
Earn $6923 By Typing Names Online! Available Worldwide: https://q1-earn-1000usd-per-week-162.blogspot.co.nz?v=12