Low-complexity aggregation in GraphLog and Datalog

DOI10.1016/0304-3975(93)90221-EzbMath0797.68045OpenAlexW2155996966MaRDI QIDQ688669

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

zbMATH Keywords

parallel complexityDatalogaggregate functionsclosed semiringsdatabase graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic programming (68N17) Semirings (16Y60)

Related Items (6)

Recursive rules with aggregation: a simple unified semantics ⋮ Query languages for bags and aggregate functions ⋮ Expressive power of SQL. ⋮ Unnamed Item ⋮ Local properties of query languages ⋮ Unnamed Item

Uses Software

• Datalog
• GraphLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of problems with fast parallel algorithms
• Languages that Capture Complexity Classes
• Nondeterministic Space is Closed under Complementation
• Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
• Expressibility and Parallel Complexity

This page was built for publication: Low-complexity aggregation in GraphLog and Datalog