Towards an efficient evaluation of recursive aggregates in deductive databases
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3982556 (Why is no real title available?)
- scientific article; zbMATH DE number 219215 (Why is no real title available?)
- scientific article; zbMATH DE number 219218 (Why is no real title available?)
- scientific article; zbMATH DE number 970737 (Why is no real title available?)
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
- Monotonic aggregation in deductive databases
- Negation by default and unstratifiable logic programs
- On the power of magic
- Recursive query processing: The power of logic
- The Alexander Method - a technique for the processing of recursive axioms in deductive databases
Cited in
(4)- Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA)
- Low-complexity aggregation in GraphLog and Datalog
- On the equivalence and rewriting of aggregate queries
- Efficient incremental maintenance for distributive and non-distributive aggregate functions
This page was built for publication: Towards an efficient evaluation of recursive aggregates in deductive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326572)