Monotonic Aggregation in Deductive Databases

Kenneth A. Ross, Yehoshua Sagiv

Research output: Contribution to journalArticlepeer-review

49 Scopus citations

Abstract

We propose a semantics for aggregates in deductive databases based on a notion of minimality. Unlike some previous approaches, we form a minimal model of a program component including aggregate operators, rather than insisting that the aggregate apply to atoms that have been fully determined or that aggregate functions are rewritten in terms of negation. In order to guarantee the existence of such a minimal model we need to insist that the domains over which we are aggregating are complete lattices and that the program is in a sense monotonic. Our approach generalizes previous approaches based on the well-founded semantics and various forms of stratification. We are also able to handle a large variety of monotonic (or pseudo-monotonic) aggregate functions.

Original languageEnglish
Pages (from-to)79-97
Number of pages19
JournalJournal of Computer and System Sciences
Volume54
Issue number1
DOIs
StatePublished - Feb 1997

Fingerprint

Dive into the research topics of 'Monotonic Aggregation in Deductive Databases'. Together they form a unique fingerprint.

Cite this