R. Nikhil, "Semantics of Update in a FDBPL," in Proceedings of the Workshop on Database Programming Languages, Roscoff, France, September 1987, pp. 365-383. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Improving List Comprehension Database Queries - Trinder, Wadler (1989) (26 citations) (Correct)
....list processing to compute database queries is not a new idea. Buneman et al. have built a commercial database system using lists [7] Breuer, Nikhil and Poulovassilis have all described functional database systems and also recommend list comprehensions as a powerful notation for expressing queries [6, 17, 19]. Transformation methods are well developed in both the functional programming community [5, 8, 10] and the database community [15, 20, 26] Freytag [12] has shown how to transform functional notations to improve a query evaluation plan. The query evaluation plan is the output of an algebraic ....
R. Nikhil, "Semantics of Update in a FDBPL," in Proceedings of the Workshop on Database Programming Languages, Roscoff, France, September 1987, pp. 365-383.
Comprehensions, a Query Notation for DBPLs - Trinder (1990) (23 citations) (Correct)
....the DBPL can be automatically extended to compile and optimise comprehension queries over values of the new type. In related work Breuer, Nikhil and Poulovassilis have all described functional databases and also recommend list comprehensions as a clear and powerful notation for expressing queries [7, 20, 22]. This paper is the first analysis of the potential of ringad comprehensions as a DBPL query notation. Work by both Nikhil and Heytens, and Kato et al., on the parallel evaluation of comprehensions is described in Section 3. Comprehensions are similar to DBPL access expressions [23] The ....
....x A above, making x range over the elements of the list A. More generally, a generator of the form P E contains a pattern P that binds one or more new variables to components of each element of the list. Queries List comprehensions easily express queries over relational [7, 24] functional [20, 22] and object oriented databases [11] For concreteness let us consider the relational model, specifically a database with three relations used by Ullman [32] members (name, address, balance) orders (order no, oname, oitem, quantity) suppliers (sname, saddress, sitem, sprice) Let us assume that ....
[Article contains additional citation context not shown here]
Nikhil R.S. Semantics of Update in a FDBPL. Proceedings of the Workshop on Database Programming Languages, Roscoff, France (September 1987), 365-383.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC