✦ LIBER ✦

Monotonic Aggregation in Deductive Databases

✍ Scribed by Kenneth A Ross; Yehoshua Sagiv

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 757 KB
Volume: 54
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1453

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Checking functional consistency in deduc

Checking functional consistency in deductive databases

✍ Erik Lambrichts; Peter Nees; Jan Paredaens; Peter Peelman; Letizia Tanca 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Consistency preserving updates in deduct

Consistency preserving updates in deductive databases

✍ Enric Mayol; Ernest Teniente 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 399 KB

Scalar aggregation in inconsistent datab

Scalar aggregation in inconsistent databases

✍ Marcelo Arenas; Leopoldo Bertossi; Jan Chomicki; Xin He; Vijay Raghavan; Jeremy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 260 KB

We consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. We deÿne consistent answers to such queries to be greatest-lowest/leastupper bounds on the value of the scalar function across all (minimal) repairs of the database. We show how to compu

Semantics and properties of existential

Semantics and properties of existential quantifiers in deductive databases

✍ Sang Ho Lee; Lawrence J. Henschen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 587 KB

A study of relevance for learning in ded

A study of relevance for learning in deductive databases

✍ Nada Lavrač; Dragan Gamberger; Viktor Jovanoski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 288 KB

This paper is a study of the problem of relevance in inductive concept learning. It gives definitions of irrelevant literals and irrelevant examples and presents ecient algorithms that enable their elimination. The proposed approach is directly applicable in propositional learning and in relation le

Semantics and Expressive Power of Nondet

Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases

✍ Fosca Giannotti; Dino Pedreschi; Carlo Zaniolo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Nondeterministic extensions are needed in logic-based languages, such as first-order relational languages and Datalog, to enhance their expressive power and support the efficient formulation of low-complexity problems and database queries. In this paper, we study the semantics and expressive power o