How expressive is stratified aggregation?

DOI10.1007/BF01536403MaRDI QIDQ1924786zbMATH OpenOpenAlexFDO

Authors Inderpal S. Mumick, Oded Shmueli

Publication date 20 October 1996

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01536403

zbMATH Keywords

computable queriesdeductive database languages

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Low-complexity aggregation in GraphLog and Datalog
• scientific article; zbMATH DE number 219218
• Comparison of expressive power of some query languages for databases

Cites work

• Computable queries for relational data bases
• Horn clause computability
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 219218 (Why is no real title available?)
• Implementation of logical query languages for databases
• Monotonic aggregation in deductive databases

Cited in

(10)

• How much better is disaggregate data?
• A datalog-based computational model for coordination-free, data-parallel systems
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Who's afraid of aggregating money metrics?
• scientific article; zbMATH DE number 219218 (Why is no real title available?)
• The expressive power of higher-order Datalog
• A declarative extension of horn clauses, and its significance for Datalog and its applications
• Logics with aggregate operators
• Low-complexity aggregation in GraphLog and Datalog
• Modern Datalog: concepts, methods, applications (invited paper)

Describes a project that uses

Uses Software

• GraphLog

This page was built for publication: How expressive is stratified aggregation?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924786)