See this document in CiteSeerX!

Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs (1990)  (Make Corrections)  (28 citations)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Proceedings of the 16th Conference on Very Large Databases, Morgan Kaufman pubs. (Los Altos CA), Brisbane



  Home/Search   Context   Related

 
View or download:
att.com/~divesh/papers/rss90eval.ps
wisc.edu/coral/doc/old/vldb90.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  att.com/~divesh/papers/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. However, it is often desirable --- and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics --- to apply the rules in some order. An important property of a fixpoint evaluation algorithm is that it does not repeat inferences; we say that such algorithms have the semi-naive property. The semi-naive algorithms in the literature do... (Update)

Context of citations to this paper:   More

...duplicated facts, and the memoization of intermediate results. As examples, we have the transformations called Generalized Magis Sets [RSS90, BR91, RSS92, Bra95, KSS95] Generalized Supplementary Magic Sets [BR91] Magic Templates [Ram91] Alexander Templates [Sek89] Counting...

.... be retrieved are in a non materialized view, it uses seminaive bottom up fixpoint evaluation with rule ordering mechanism as proposed in [29] or top down with pipeling to find the results The DML Manager performs all the updates to the extensional relations. As an update may...

Cited by:   More
Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995)   (Correct)
Using Datalog with Binary Decision Diagrams for Program.. - Whaley, Avots, Carbin, Lam   (Correct)
Learning Recursive Theories in the Normal ILP Setting - Malerba (2003)   (Correct)

Similar documents (at the sentence level):
28.4%:   Rule Ordering in Bottom-Up Fixpoint Evaluation of.. - Ramakrishnan.. (1990)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Bottom-up Evaluation and Query Optimization of.. - Kemp, Srivastava, Stuckey (1995)   (Correct)
0.2:   Magic Sets and Bottom-up Evaluation of Well-Founded Models - Kemp, Stuckey (1991)   (Correct)
0.1:   Aggregation and Relevance in Deductive Databases - Sudarshan, Ramakrishnan (1991)   (Correct)

Similar documents based on text:   More   All
0.4:   Heraclitus: Elevating Deltas to be First Class.. - Ghandeharizadeh.. (1995)   (Correct)
0.3:   Déjà Vu in Fixpoints of Logic Programs - Maher, Ramakrishnan (1989)   (Correct)
0.2:   Controlling the Search in Bottom-Up Evaluation - Ramakrishnan, Srivastava.. (1992)   (Correct)

Related documents from co-citation:   More   All
15:   Magic Sets and Other Strange Ways to Implement Logic Programs (context) - Bancilhon, Maier et al. - 1986
15:   A Generalization of the Differential Approach to Recursive Query Relations (context) - Balbin, Ramamohanarao
11:   the power of magic - Beeri, Ramakrishnan - 1987

BibTeX entry:   (Update)

Ramakrishnan, R., Srivastava, D. and Sudarshan S. Rule Ordering Bottom-Up Fixpoint Evaluation of Logic Programs. In Proceedings of the International Conference on Very Large Data Bases, Brisbane, Australia (1990), 359--371. http://citeseer.ist.psu.edu/ramakrishnan90rule.html   More

@inproceedings{ ramakrishnan90rule,
    author = "R. Ramakrishnan and D. Srivastava and S. Sudarshan",
    title = "Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs",
    booktitle = "Proceedings of the 16th Conference on Very Large Databases, Morgan Kaufman pubs. (Los Altos {CA}), Brisbane",
    year = "1990",
    url = "citeseer.ist.psu.edu/ramakrishnan90rule.html" }
Citations (may not include all citations):
50   A Generalization of the Differential Approach to Recursive Q.. (context) - Balbin, Ramamohanarao
42   Naive Evaluation of Recursively Defined Relations (context) - Bancilhon - 1985
20   Efficient Bottom-Up Computation of Queries on Stratified Dat.. (context) - Balbin, Port et al.
6   Magic Implementation of Stratified Programs (context) - Beeri, Ramakrishnan et al.
2   Inductive and Deductive Control of Logic Programs (context) - Helm - 1987



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.research.att.com/~divesh/papers/index.html):   More
Data Model and Query Evaluation in Global Information Systems - Levy, Srivastava, Kirk (1991)   (Correct)
Interaction of Query Evaluation and Buffer Management.. - Jónsson, Franklin.. (1998)   (Correct)
Chasing Constrained Tuple-Generating Dependencies - Maher, Srivastava (1996)   (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