Affiliation:
1. Univ. of Pennsylvania, Philadelphia
2. General Research Corp., Santa Barbara, CA
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Lazy evaluation of transactions in database systems;Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data;2014-06-18
2. Well-Defined NRC Queries Can Be Typed;In Search of Elegance in the Theory and Practice of Computation;2013
3. Steno;ACM SIGPLAN Notices;2011-06-04
4. Database Management;Secure Semantic Service-Oriented Systems;2010-12-15
5. Generic multiset programming with discrimination-based joins and symbolic Cartesian products;Higher-Order and Symbolic Computation;2010-09