Abstract
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. © 1982, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Buneman, P., Frankel, R. E., & Nikhil, R. (1982). An Implementation Technique for Database Query Languages. ACM Transactions on Database Systems (TODS), 7(2), 164–186. https://doi.org/10.1145/319702.319711
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.