Science Fair Project Encyclopedia
Relational database management system
History of the term
Codd introduced the term in his seminal paper A Relational Model of Data for Large Shared Data Banks. In this paper and later papers he defined what he meant by relational. One well-known definition of what constitutes a relational database system is Codd's 12 rules. However, many of the early implementations of the relational model did not conform to all of Codd's rules, so the term gradually came to describe a broader class of database systems. At a minimum, these systems:
- presented the data to the user as relations (a presentation in tabular i.e. as a collection of tables, each table consisting of a set of rows and columns, can satisfy this property)
- provided relational operators to manipulate the data in tabular form
There is some disagreement about what can or cannot be called a "relational" DBMS.
The most popular definition of a RDBMS is relatively imprecise; some argue that merely presenting a view of data as a collection of rows and columns is sufficient to qualify as a RDBMS. Typically, products that qualify as a RDBMS under this interpretation implement some of Codd's 12 rules, but most popular database systems do not support them all.
A second school of thought argues that if a database does not implement all of Codd's rules, it is not relational. This view, shared by many theorists and other strict adherents to Codd's principles, would disqualify many database systems from being considered "truly relational". In fact, any database that uses the SQL (Structured Query Language) to access and modify data is not an RDBMS under this definition. Advocates of this philosophy refer to systems that follow some but not all of the rules as Pseudo-Relational Database Management Systems (PRDBMS). For clarification, they often refer to RDBMSs that do follow all of the rules Truly-Relational Database Management Systems (TRDBMS).
Nowaday, the choice of RDBMS has become much less dependent on meeting all of Codd's 12 rules and much more dependent on providing a manageable Total cost of ownership to data management organizations within IT organizations. This is both unfortunate and ironic as meeting the proper relational criteria would provide products of greater reliability and consistency, higher productivity and higher performance thus providing a great contribution to total cost of ownership. These advantages are indeed the primary motives for those insisting on products being properly relational. Today, almost all RDBMSs with any degree of popularity employ SQL as their query language but alternatives have been proposed and implemented.
Alphora's Dataphor is a commercially-available RDBMS that follows all of Codd's rules, and is considered a RDBMS by both groups. However, it is not yet popular or widespread.
- Database Debunkings - Critical point of view that argues that it is important that the predicate relational should be reserved for those database systems that are fully faithful to the relational model.
- Are SQL Server, DB2, and Oracle really relational? - An article by Itoi Blomgren, Michiko. (2003)
- A Brief History of IT Management and the RDBMS - A brief history of modern RDBMS technology from the operational perspective of information technology management practice.
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details