![]() ![]() ![]() ![]() |
| The Associative Model of Data | |||||||||||
|
Click here to review the book's Contents, or here for its Preface. You can download the book in PDF form our Downloads
page. |
|||||||||||
| Why a new data model? | |||||||||||
|
However, 4GLs have failed to win widespread acceptance, and today's object-oriented programming languages are in truth no more abstract with respect to the real world than their third-generation predecessors. Moreover, the commercial failure of object-oriented databases means that most modern commercial applications are designed and developed using object oriented techniques, but implemented over relational databases, an impedance mis-match that imposes further overheads on the development process. Ted Codd acknowledged the connection between data architecture and programming productivity when in 1970 he introduced the relational model to the world with the words "Future users of large data banks must be protected from having to know how the data is organized in the machine". The next major breakthrough in software
development productivity will come not from advances in programming languages,
but from a new database architecture. |
"Future users of large data banks must be protected from having to know how the data is organized in the machine" - Dr E F Codd, "A Relational Model of Data for Large Shared Data Banks", CACM, 1970 |
||||||||||
| Omnicompentent Programming | |||||||||||
|
This sets the scene for a new way of programming, whereby
the data structures and the rules that govern them are no longer hard-coded
into the programs, but are obtained by the programs from the database
itself. Thus, for the first time, such programs are truly reusable, and
no longer need to be amended when the data structures change. This dramatically
reduces the cost of application development and maintenance. |
Our aim is to free them in addition from having to know its logical structure. |
||||||||||
|
|||||||||||