Towards an efficient evaluation of recursive aggregates in deductive databases

DOI10.1007/BF03037339zbMath0804.68021OpenAlexW1972376013MaRDI QIDQ1326572

Alexandre Lefebvre

Publication date: 18 May 1994

Published in: New Generation Computing (Search for Journal in Brave)

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

zbMATH Keywords

aggregatesdeductive databasesaggregate functiondeclarative semanticsaggregate programsextended datalogrecursive aggregates

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Uses Software

• GraphLog

Cites Work

• Monotonic aggregation in deductive databases
• Negation by default and unstratifiable logic programs
• Recursive query processing: The power of logic
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• On the power of magic
• Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards an efficient evaluation of recursive aggregates in deductive databases