A graphical query language supporting recursion

ACM SIGMOD Record

Volumn 16, Issue 3, 1987, Pages 323-330

  Cruz, Isabel F ^a   Mendelzon, Alberto O ^a   Wood, Peter T ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976661396     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/38714.38749     Document Type: Article

References (19)

1. A. V. AHO, J E Hopcroft, And J D Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974
2. A. V. Aho, Y Sagiv, and J D Ullman, “Efficient Optimization of a Class of Relational Expressions,” ACM Trans on Database Syst, vol 4, no 4, pp 435–454,1979
3. A. V. Aho And J D Ullman, “Universality of Data Retrieval Languages,” Proc 6th ACM Symp on Principles of Programming Languages, pp 110–120,1979
4. F. bancilhon, D. maier, Y. Sagiv, and J. D. ullman, “Magic Sets and Other Strange Ways To Implement Logic Programs,” Proc 5th ACM SIGACT—SIGMOD Symp on Principles of Database Systems, pp 1–15,1986
5. A. K. Chandra and D Harel, “Horn Clause Queries and Generalizations,” J Logic Programming, vol 2, no 1,pp 1–15,1985 Originally appeared as “Horn Clauses and the Fixpoint Query Hierarchy”, Proc 1st ACM SIGACT— SIGMOD Symp on Principles of Database Systems, pp 158–163,1982
6. A. K. Chandra And P M Merlin, “Optimal Implementation of Conjunctive Quenes in Relational Data Bases,” Proc 9th ACM Symp on Theory of Computing, pp 77–90, 1977
7. E. Clemons, “Design of an External Schema Facility to Define and Process Recursive Structures,” ACM Trans on Database Syst, vol 6, no 2,pp 295–311, 1981
8. W. F. Clocksin And C S Melush, Programming in Prolog, Springer-Verlag, 1981
9. U. Dayal And J M Smith, “PROBE A Knowledge-Oriented Database Management System,” in On Knowledge Base Management Systems Integrating Artificial Intelligence and Database Technologies, ed M L Brodie and J Mylopoulos, pp 227–257, Springer-Verlag, 1986
10. S. Fortune, J Hopcroft, And J Wyllie, “The Directed Subgraph Homeomorphism Problem,” Theor Comput Sci.vol 10.pp 111–121,1980
11. S. Heiler And A Rosenthal, “G-WHIZ, a Visual Interface for the Functional Model with Recursion,” Proc 11th Conf on Very Large Data Bases, 1985
12. L. J. Henschen AND S A Naqvi, “On Compiling Quenes in Recursive First-Order Databases,” J ACM, vol 31, no 1, pp 47–85,1984
13. A. S. Lapaugh and R L Rivest, “The Subgraph Homeomorphism Problem,” Proc 10th Ann ACM Symp on Theory of Computing, pp 40–50,1978
14. A. O. Mendelzon and P T Wood, “A Graphical Query Language Supporting Recursion,” Tech Report CSRI-183, Univ of Toronto, 1986
15. A. Rosenthal, S Heiler, U Dayal, and F manola, “Traversal Recursion A Practical Approach to Supporting Recursive Applications,” Proc ACM SIGMOD Conf on Management of Data, pp 166–176,1986
16. D. Sacca and C Zaniolo, “On the Implementation of a Simple Class of Logic Quenes,” Proc 5th ACM SIGACT—SIGMOD Symp on Principles of Database Systems, pp 16–23,1986
17. J. D. Ullman, “Implementation of Logical Query Languages for Databases,” ACM Trans on Database Syst, vol 10, no 3, pp 289–321, 1985 Originally appeared as Stanford Univ, Dept of Computer Science TR (May 1984)
18. M. Y. VARDI, “The Complexity of Relational Query Languages,” Proc 14th Ann ACM Symp on Theory of Computing, pp 137–146,1982
19. M. M. ZLOOF, “Query by Example Operations on the Transitive Closure,” IBM Research Report, RC5526, 1976