Polymorphic programming languages: design and implementation
Polymorphic programming languages: design and implementation
Communicating sequential processes
Communicating sequential processes
Relational Information Systems
Relational Information Systems
Fundamentals of programming languages (2nd ed.)
Fundamentals of programming languages (2nd ed.)
Types and persistence in database programming languages
ACM Computing Surveys (CSUR)
Data types and persistence
ACM Transactions on Database Systems (TODS)
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
| Hi-index | 0.00 |
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.