How expressive is stratified aggregation?

DOI10.1007/BF01536403zbMath0858.68031OpenAlexW2065975085MaRDI QIDQ1924786

Oded Shmueli, Inderpal Singh Mumick

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)

Related Items (3)

A datalog-based computational model for coordination-free, data-parallel systems ⋮ Fixpoint semantics and optimization of recursive Datalog programs with aggregates ⋮ A declarative extension of horn clauses, and its significance for datalog and its applications

Uses Software

• GraphLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic aggregation in deductive databases
• Computable queries for relational data bases
• Implementation of logical query languages for databases
• Horn clause computability

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