David Kemp  Home/Search
Context Related
| cs.mu.oz.au/~kemp/papers/tr896.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.mu.oz.au/~kemp/papers...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Context of citations to this paper: More
...such as magic templates [206] produces a 24 program P mg that is equivalent to P for the specific query. Other techniques [146, 193, 237, 147] attempt to further limit execution by placing constraints at appropriate points in the program. Analyses can be used to check that...
...bind a variable not to a unique value, but to a finite number of values, or filtering rather than binding constraints such as X 1. In [8] it was shown how a technique known as constraint propagation may be used to insert constraints associated with a query into the...
Cited by: More
Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995) (Correct)
Constraint-Based Query Evaluation in Deductive Databases - Han (1994) (Correct)
Toward Practical Query Evaluation for Constraint Databases - Brodsky, Jaffar, Maher (1997) (Correct)
Active bibliography (related documents): More All
0.4: The Aditi deductive database system - Vaghani, Ramamohanarao, Kemp.. (1990) (Correct)
0.3: Magic Templates: A Spellbinding Approach to Logic Programs - Ramakrishnan (1988) (Correct)
0.3: Right-, Left- and Multi-Linear Rule Transformations That.. - David Kemp (1990) (Correct)
Similar documents based on text: More All
0.5: A Dynamic Approach to Deductive Query Evaluation - Behrend (Correct)
0.1: Using Optimized Multi-attribute Hash Indexes for Hash Joins - Evan Harris (1993) (Correct)
0.1: Using Optimized Multi-Attribute Hash Indexes For Hash Joins - Evan Harris (1993) (Correct)
Related documents from co-citation: More All
10: Magic Sets and Other Strange Ways to Implement Logic Programs (context) - Bancilhon, Maier et al. - 1986
9: Efficient evaluation of right (context) - Naughton, Ramakrishnan et al. - 1989
6: Implementation of logical query languages for databases (context) - Ullman - 1985
BibTeX entry: (Update)
D. B. Kemp, K. Ramamohanarao, I. Balbin, and K. Meenakshi. Propagating constraints in recursive deductive databases. In Proceedings of the First North American Conference on Logic Programming, 981--998, October 1989. http://citeseer.ist.psu.edu/kemp89propagating.html More
@inproceedings{ kemppropagating,
author = "D. B. Kemp and K. Ramamohanarao and I. Balbin and K. Meenakshi",
title = "Propagating Constraints in Recursive Deductive Databases",
pages = "981--1000",
url = "citeseer.ist.psu.edu/kemp89propagating.html" }
Citations (may not include all citations):981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988
204 Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
121 the power of magic - Beeri, Ramakrishnan - 1987
99 Logic and databases: A deductive approach (context) - Gallaire, Minker et al. - 1984
67 Foundations of Deductive Databases and Logic Programming (context) - Minker - 1988
64 Optimizing datalog programs (context) - Sagiv
40 Sets and negation in a logic database language (context) - Beeri, Naqvi et al. - 1987
40 Implementation of logical query languages for databases (context) - Ullman - 1985
30 Performance evaluation of data intensive logic programs (context) - Bancilhon, Ramakrishnan
26 The alexander method - a technique for the processing of rec.. (context) - Rohmer, Lescoeur et al. - 1986
20 The generalized counting method for recursive logic queries - Sacca, Zaniolo - 1986
19 A framework for testing safety and effective computability o.. (context) - Krishnamurthy, Shmueli et al. - 1988
17 The representation and deductive retrieval of complex object.. (context) - Zaniolo - 1985
15 Magic counting methods (context) - Sacca, Zaniolo - 1987
13 yet another window on nail (context) - Morris, Naughton et al. - 1987
10 An axiomatic approach to deciding query safety in deductive .. (context) - Kifer, Ramakrishnan et al. - 1988
6 Magic set computation for stratified databases (context) - Balbin, Port et al. - 1987
4 Compiling control (context) - Bruynooghe, de Schreye et al. - 1986
4 The nu-prolog deductive database system (context) - Ramamohanarao, Shepherd et al. - 1987
1 A generalisation of the differential approach to recursive q.. (context) - Balbin, Ramamohanarao - 1987
1 On query evaluation in deductive database systems (context) - Kemp - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.mu.oz.au/~kemp/papers/papers.html): More
Optimizing Bottom-Up Evaluation of Constraint Queries - Kemp, Stuckey (1996) (Correct)
A Deductive Database Solution to the Preferential Vote Counting .. - David Kemp (Correct)
Semantics of Logic Programs with Aggregates - Kemp, Stuckey (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC