Low-complexity aggregation in GraphLog and Datalog
From MaRDI portal
Publication:688669
DOI10.1016/0304-3975(93)90221-EzbMATH Open0797.68045OpenAlexW2155996966MaRDI QIDQ688669FDOQ688669
Authors: Mariano P. Consens, Alberto O. Mendelzon 
Publication date: 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90221-e
Recommendations
Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Database theory (68P15) Semirings (16Y60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A taxonomy of problems with fast parallel algorithms
- Nondeterministic Space is Closed under Complementation
- Languages that Capture Complexity Classes
- Expressibility and Parallel Complexity
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Expressive power of SQL.
- How much are your geraniums? Taking graph conditions beyond first order
- Local properties of query languages
- Aggregated search in graph databases: preliminary results
- Title not available (Why is that?)
- Merging graph-based and rule-based computation: The language G-Log
- Query languages for bags and aggregate functions
- Querying best paths in graph databases
- Logics with aggregate operators
- Aggregation in functional query languages
- Recursive rules with aggregation: a simple unified semantics
- Title not available (Why is that?)
Uses Software
This page was built for publication: Low-complexity aggregation in GraphLog and Datalog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688669)
