There is some disagreement on the definition of "relational" of the DBMS. The most popular definition of an RDBMS is often considered to be less precise, some argue that the presentation of data as a collection of rows and columns are qualified enough to be regarded as an RDBMS. Typically, a database is said to meet the criteria as RDBMS if it meets the laws specified in 12 Codd law, but in fact, most database systems do not fully support the implementation of these laws Codd. Among others believe if a database does not implement all the laws Codd, then the system can not be referred to as relational. This view, which is widely accepted by the theoretical and the other circles who hold fast to the principles of Codd, of course, would disqualify many existing database systems is "not purely relational". In fact, database systems using SQL (Structured Query Language) to access and modify the data can not be regarded as RDBMS according to this definition. Meanwhile, supporters of the existing database systems mentions a database system that implements only some of these laws Codd called Semi-Relasional/Pseudo-Relational Database Management Systems Database Management Systems (PRDBMS). For database management system that fully implements such laws Codd hereinafter Murni-Relasional/Trully-Relational Database Management Systems Database Management Systems (TRDBMS). Currently, almost all existing RDBMS SQL as a query language to implement but also provides and implements several other alternatives. Alpora Dataphor is commercially available RDBMS which follows in full to twelve laws Codd, and both groups know as the RDBMS.
Please join StudyMode to read the full document