Abstract / Description of output
Structured query languages, such as those available for relational databases, are becoming increasingly desirable for all database management systems. Such languages are applicative: there is no need for an assignment or update statement. A new technique is described that allows for the implementation of applicative query languages against most commonly used database systems. The technique involves "lazy" evaluation and has a number of advantages over existing methods: it allows queries and functions of arbitrary complexity to be constructed; it reduces the use of secondary storage; it provides a simple control structure through which interfaces to other programs may be constructed; and the implementation, including the database interface, is quite compact. Although the technique is presented for a specific functional programming system and for a CODASYL DBMS, it is general and may be used for other query languages and database systems.
Original language | English |
---|---|
Pages (from-to) | 164-186 |
Number of pages | 23 |
Journal | ACM Transactions on Database Systems |
Volume | 7 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1982 |