Propagating Constraints in Recursive Deductive Databases (1989)
| Venue: | In Proceedings of the First North American Conference on Logic Programming |
| Citations: | 23 - 6 self |
BibTeX
@INPROCEEDINGS{Kemp89propagatingconstraints,
author = {David Kemp and Krishnamurthy Meenakshi and Isaac Balbin and Kotagiri Ramamohanarao},
title = {Propagating Constraints in Recursive Deductive Databases},
booktitle = {In Proceedings of the First North American Conference on Logic Programming},
year = {1989},
pages = {981--998},
publisher = {MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In traditional database systems, as in deductive databases that do not contain recursive rules, the efficient retrieval of tuples satisfying a constraint such as "retrieve all people who earn more than 30,000 dollars" is crucial to the performance of the database system. We investigate an algorithm which permits the "early use" of constraints to guide a bottom-up computation of recursive rules. The algorithm is an adaptation of the well-known fold/unfold transformations and is designed to work in conjunction with the magic set approach. A contribution of the algorithm is that it generalises the ability of magic-sets to transform a program, traditionally based on argument bindings within a rule or query, to the case of arguments in a rule or query which are constrained, but not necessarily bound. In addition, it permits the implementation of a bi-directional sip (sideways information passing strategy). 1 Introduction The field of Deductive Databases [8], is concerned with developing...
