Issue No. 11 - November (1989 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.41335
<p>Scalars, arrays, and records, together with associated operations and syntax, have been introduced as special cases of relations into the relational programming system, relix. This permits all of these data types, as well as relations, to be stored persistently. The requirement in most languages that array elements and record fields can be assigned to leads in this case to the general implementation of QT-selectors as l-expressions, with, in particular, systematic interpretations of assignment to projections and selections of relations. The authors discuss the principles and the implementation of this extension to the relational algebra. They take advantage of the very specialized syntax of array access to build a tuned access method, using B-trees and Z-order. The performance results show the advantage of this implementation over the slower implementation required for general QT-selectors.</p>
scalars; programming language; relational algebra; records; syntax; relations; relational programming system; relix; data types; QT-selectors; l-expressions; systematic interpretations; projections; array access; tuned access method; B-trees; Z-order; data structures; database theory; high level languages; relational databases
T. Merrett and N. Laliberte, "Including Scalars in a Programming Language Based on the Relational Algebra," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 1437-1443, 1989.