Low-complexity aggregation in GraphLog and Datalog
- 2 August 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 116 (1) , 95-116
- https://doi.org/10.1016/0304-3975(93)90221-e
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The G+/GraphLog Visual Query SystemPublished by Association for Computing Machinery (ACM) ,1990
- IDLOG: extending the expressive power of deductive database languagesPublished by Association for Computing Machinery (ACM) ,1990
- GraphLogPublished by Association for Computing Machinery (ACM) ,1990
- Extensions to query languages for graph traversal problemsIEEE Transactions on Knowledge and Data Engineering, 1990
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- Extending relational algebra and relational calculus with set-valued attributes and aggregate functionsACM Transactions on Database Systems, 1987
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Traversal recursion: a practical approach to supporting recursive applicationsPublished by Association for Computing Machinery (ACM) ,1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate FunctionsJournal of the ACM, 1982