S. A. GR/gIBACH, "Theory of Program Structures: Schemes, Semantics, Verification," Lecture Notes in Computer Science No. 36, Springer-Verlag, Berlin/New York/Heidelberg, 1975.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Computable Queries for Relational Databases - Chandra, Harel (1980)   (184 citations)  (Correct)

....are randomly probed to estimate the average salary (see [20] for a general probabilistic construct) Another extension is where a query language is augmented with usersupplied procedures. In this case, the query can be thought of as a query schema, and concepts from program schemata (see, e.g. [13, 17]) could be used. These extensions also remain largely unexplored. 7. DIRECTIONS FOR FUTURE WORK Several interesting possibilities present themselves for further research. First, results similar to ours can be proved for systems other than relational data bases. For example, analogous results ....

S. A. GR/gIBACH, "Theory of Program Structures: Schemes, Semantics, Verification," Lecture Notes in Computer Science No. 36, Springer-Verlag, Berlin/New York/Heidelberg, 1975.

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