A solution to the problem of low computational efficiency of the relational data model is investigated. An extension of the relational algebra with the help of operations over data sets, i.e., the basic construction of CODASYL DBTG proposals, is suggested. A user is able to choose a method for implementing data links depending on the following requirements for their processing speed: a slow but flexible option based on symbolic addressing typical of relational DBMSs, or a fast but hard option based on direct pointers (relative addressing) typical of DBMSs of the pre-relational era.
展开▼
