Low complexity aggregation in graphlog and datalog

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 470 LNCS, Issue , 1990, Pages 379-394

  Consens, Mariano P ^a   Mendelzon, Alberto O ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; GRAPH THEORY; INTELLIGENT DATABASES; PLANT SHUTDOWNS; QUERY PROCESSING; VISUAL LANGUAGES;

AGGREGATE FUNCTION; EXPRESSIVE POWER; FIRST-ORDER LANGUAGE; FORMAL MODEL; PARALLEL COMPLEXITY; RECURSIVE PROGRAMS; TRANSITIVE CLOSURE; VISUAL QUERY LANGUAGES;

QUERY LANGUAGES;

EID: 85032878349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-53507-1_90     Document Type: Conference Paper

References (29)

1. Serge Abiteboul and Catriel Beeri. On the power of languages for the manipulation of complex objects. Technical Report 846, INRJA, May 1988.
2. R. Agrawal, S. Dar, and H.V. Jagadish. On transitive closure problems involving path computations. Technical report, AT&T Bell Laboratories, 1988.
3. E. Agrawal. Alpha: an extension of relational algebra to express a class of recursive queries. In Proc. IEEE 3rd. International Conference on Data Engineering, pages 580-590,1987.
4. Mariano Consens and Alberto Mendelzon. Expressing structural hypertext queries in GraphLog. In Proceedings of the Second ACM Hypertext Conference, pages 269-292, 1989.
5. +/GraphLog visual query system. In Proceedings of the ACM-SIGMOD 1990 Annual Conference on Management of Data, page 388, 1990. Video presentation summary.
6. Mariano Consens and Alberto Mendelzon. GraphLog: a visual formalism for real life recursion. In Proceedings of the Ninth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 404-416, 1990.
7. +: Recursive queries without recursion. In Proceedings of the Second International Conference on Expert Database Systems, pages 355-368,1988.
8. Isabel Cruz and Theodore Norvell. Aggregative closure: An extension of transitive closure. In Proc. IEEE 5th International Conference on Data Engineering, pages 384-391, 1989.
9. Mariano P. Consens. Graphlog: “real life” recursive queries using graphs. Master’s thesis, Department of Computer Science, University of Toronto, 1989.
10. Eric C. Cooper. On the expressive power of query languages for relational databases. Technical Report TR-14-80, Aiken Computation Lab., Harvard University, 1980.
11. Stephen A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64(1-3):2-22,1985.
12. +: A graphical system for recursive queries. Master’s thesis, Dept. of Computer Science, University of Toronto, 1987.
13. U. Dayal and J.M. Smith. Probe: A knowledge-oriented database management system. In Michel L. Brodie and John Mylopoulos, editors, On knowledge base management systems, pages 227-257. Springer-Verlag, 1986.
14. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H, Freeman and Co., New York, 1979.
15. Marc Gyssens, Jan Paredaens, and Dirk Van Gucht. A graph-oriented object database model. In Proceedings of the Ninth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 417-424,1990.
16. Neil Immerman. Languages, that capture complexity classes. SIAM Journal on Computing, 16(4):760-778, 1987.
17. Neil Immerman. Expressibility and parallel complexity. Technical report, Department of Computer Science, Yale University, 1988.
18. Y.E. Ioannidis and R. Ramakrishnan. Efficient transitive closure algorithms. Technical Report 765, Computer Sciences, Univ. of Wisconsin-Madison, 1988.
19. P.C. Kanellakis. Logic programming and parallel complexity. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 547-586. Morgan Kaufmann Publishers, Inc., 1988.
20. Anthony Klug. Equivalence of relational algebra and relational calculus query languages having aggregate functions. Journal of the ACM, 29(3):699-717,1982.
21. P. G. Kolaitis and CH. Papadimitriou. Why not negation by fixpoint? In Proceedings of the Sixth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 231-239,1987.
22. G.M. Kuper. Logic programming with sets. In Proceedings of the Sixth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 11-20, 1987.
23. Inderpal Mumick, Hamid Pirahesh, and Raghu Ramakrishnan. The magic of duplicates and aggregates. In Proceedings of the Sixteenth International Conference on Very Large Data Bases, 1990. To appear.
24. G. Ozsoyoglu, Z.M. Ozsoyoglu, and V. Matos. Extending relational algebra and relational calculus with set-valued attributes and aggregate functions. ACM Transactions on Data Base Systems, 12(4):566-592,1987.
25. A. Rosenthal, S. Heiler, U. Dayal, and F. Manola. Traversal recursion: A practical approach to supporting recursive applications. In Proceedings of the ACM-SIGMOD 1986 Annual Conference on Management of Data, pages 166-176,1986.
26. Yeh-Heng Sheng. IDLOG: Extending the expressive power of deductive database languages. In Proceedings of the ACM-SIGMOD 1990 Annual Conference on Management of Data, pages 54-63,1990.
27. S. Tsur and C. Zaniolo. LDL: a logic-based data-language. In Proceedings of the Twelve International Conference on Very Large Data Bases, pages 33-41, 1986.
28. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, Potomac, Md., 1988.
29. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume 2. Computer Science Press, Potomac, Md., 1989.