See this document in CiteSeerX!

Efficient Bottom-Up Evaluation Of Logic Programs (1992)  (Make Corrections)  (16 citations)
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan



  Home/Search   Context   Related

 
View or download:
att.com/~divesh/pape...rss92bupeval.ps
wisc.edu/coral/doc/bupeval.survey.ps
att.com/~divesh/pape...rss92bupeval.ps
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: . In recent years, much work has been directed towards evaluating logic programs and queries on deductive databases by using an iterative bottom-up fixpoint computation. The resulting techniques offer an attractive alternative to Prolog-style top-down evaluation in several situations. They are sound and complete for positive Horn clause programs, are well-suited to applications with large volumes of data (facts), and can support a variety of extensions to the standard logic programming... (Update)

Context of citations to this paper:   More

.... in SICStus Prolog via the CLP(Q,R) library [28] Logic based optimization techniques are also used, such as magic set transformations [42] or local subsumption [46] Since they manipulate formulas over reals instead of integers, they add an extra abstraction for which in...

.... (essentially, mixed forms of backward and forward analysis) by applying transformations such as the magic sets templates algorithm [RSS92] to the CLP programs PS PhiF . Such transformations are natural in the context of CLP programs which may also be viewed as constraint...

Cited by:   More
Attack Generation for NIDS Testing Using Natural Deduction - Shai Rubin Somesh   (Correct)
Tabled Resolution + Constraints: A Recipe for Model.. - Du, Ramakrishnan, Smolka (2000)   (Correct)
Data Structures Considered Harmful - Cleary, Utting, Clayton (2000)   (Correct)

Similar documents (at the sentence level):
5.8%:   Parallelism in Logic Programs - Ramakrishnan (1990)   (Correct)

Active bibliography (related documents):   More   All
3.7:   A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993)   (Correct)
1.5:   Rule Ordering in Bottom-Up Fixpoint Evaluation of.. - Ramakrishnan.. (1990)   (Correct)
1.1:   The CORAL Deductive System - Ramakrishnan, Srivastava, Sudarshan, .. (1994)   (Correct)

Similar documents based on text:   More   All
0.4:   Heraclitus: Elevating Deltas to be First Class.. - Ghandeharizadeh.. (1995)   (Correct)
0.4:   Magic Conditions - Mumick, Finkelstein, Pirahesh.. (1990)   (Correct)
0.3:   Controlling the Search in Bottom-Up Evaluation - Ramakrishnan, Srivastava.. (1992)   (Correct)

Related documents from co-citation:   More   All
5:   Magic Templates: A Spellbinding Approach to Logic Programs - Ramakrishnan - 1988
4:   Verification of real-time systems using linear relation analysis - Halbwachs, Proy et al. - 1997
4:   Constraint Logic Programming (context) - Jaffar, Lassez - 1987

BibTeX entry:   (Update)

Raghu Ramakrishnan, Divesh Srivastava, and S. Sudarshan. Efficient Bottom-up Evaluation of Logic Programs. In J. Vandewalle, editor, The State of the Art in Computer Systems and Software Engineering. Kluwer Academic Publishers, 1992. http://citeseer.ist.psu.edu/ramakrishnan92efficient.html   More

@misc{ ramakrishnan92efficient,
  author = "R. Ramakrishnan and D. Srivastava and S. Sudarshan",
  title = "Efficient Bottom-up Evaluation of Logic Programs",
  text = "Raghu Ramakrishnan, Divesh Srivastava, and S. Sudarshan. Efficient Bottom-up
    Evaluation of Logic Programs. In J. Vandewalle, editor, The State of the
    Art in Computer Systems and Software Engineering. Kluwer Academic Publishers,
    1992.",
  year = "1992",
  url = "citeseer.ist.psu.edu/ramakrishnan92efficient.html" }
Citations (may not include all citations):
858   The stable model semantics for logic programming - Gelfond, Lifschitz - 1988  DBLP
561   Constraint logic programming (context) - Jaffar, Lassez - 1987  ACM   DBLP
435   Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988  ACM   DBLP
315   Constraint query languages - Kanellakis, Kuper et al. - 1990  ACM   DBLP
248   The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976  ACM   DBLP
204   Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986  DBLP
163   Universality of data retrieval languages (context) - Aho, Ullman - 1979  ACM
149   A Logical Language for Data and Knowledge Bases (context) - Naqvi, Tsur - 1989  ACM
148   Rete: A fast algorithm for the many pattern/many object patt.. (context) - Forgy - 1982
121   the power of Magic - Beeri, Ramakrishnan - 1987
119   Logic-based approach to semantic query optimization (context) - Chakravarthy, Grant et al. - 1990  ACM   DBLP
118   Unfounded sets and well-founded semantics for general logic .. (context) - Van Gelder, Ross et al. - 1991  ACM   DBLP
115   Magic Templates: A spellbinding approach to logic programs - Ramakrishnan - 1988
98   Extended stable semantics for normal and disjunctive program.. (context) - Przymusinski - 1990  ACM   DBLP
90   Horn clause queries and generalizations (context) - Chandra, Harel - 1985
86   Implementing set-oriented production rules as an extension t.. - Widom, Cochrane et al. - 1991  ACM   DBLP
78   Parsing as deduction - Pereira, Warren - 1983  ACM
73   Modular Stratification and Magic Sets for DATALOG programs w.. (context) - Ross - 1990
63   A uniform approach to constraint satisfaction and constraint.. (context) - Bry, Decker et al. - 1988  ACM   DBLP
61   Monotonic aggregation in deductive databases - Ross, Sagiv - 1991  ACM   DBLP
58   A closed form for datalog queries with integer order (context) - Revesz - 1990  ACM   DBLP
54   Low complexity aggregation in Graphlog and Datalog - Consens, Mendelzon - 1990  ACM   DBLP
54   the declarative semantics of stratified deductive databases (context) - Przymusinski - 1988
52   The Aditi deductive database system - Vaghani, Ramamohanarao et al. - 1990  ACM   DBLP
50   Bottom-up beats top-down for Datalog (context) - Ullman - 1989  ACM   DBLP
50   A generalization of the differential approach to recursive q.. (context) - Balbin, Ramamohanarao - 1987  ACM   DBLP
47   IEEE Transactions on Knowledge and Data Engineering (context) - Chimenti, Gamboa et al. - 1990
46   Query evaluation in recursive databases: Bottom-up and top-d.. (context) - Bry - 1990  ACM   DBLP
45   Extension tables: Memo relations in logic programming (context) - Dietrich, Warren - 1987
44   QUIST: A system for semantic query optimization in relationa.. (context) - King - 1981
43   the power of Alexander templates (context) - Seki - 1989
43   the representation of infinite temporal data and queries - Baudinet, Niezette et al. - 1991
42   Naive evaluation of recursively defined relations (context) - Bancilhon - 1985
41   Aggregation and relevance in deductive databases - Sudarshan, Ramakrishnan - 1991  ACM   DBLP
41   Hilog: A first-order semantics for higher-order logic progra.. (context) - Chen, Kifer et al. - 1989  DBLP
40   Sets and negation in a logic database language (context) - Beeri, Naqvi et al. - 1987
40   the semantics of rule based expert systems with uncertainty (context) - Kifer, Li - 1988
40   Implementation of logical query languages for databases (context) - Ullman - 1985  ACM   DBLP
40   Semantics of logic programs with aggregates - Kemp, Stuckey - 1991  DBLP
39   Set constructors in a logic database language (context) - Beeri, Naqvi et al. - 1991  ACM   DBLP
38   Design overview of the NAIL (context) - Morris, Ullman et al. - 1986
38   Weakly perfect model semantics for logic programs (context) - Przymusinska, Przymusinski - 1988  DBLP
37   Logic programs with uncertainties: A tool for implementing r.. (context) - Shapiro - 1983
35   Decidable optimization problems for database logic programs (context) - Cosmadakis, Gaifman et al. - 1988
33   Minimum and maximum predicates in logic programming - Ganguly, Greco et al. - 1991  ACM   DBLP
32   Undecidable optimization problems for database logic program.. (context) - Gaifman, Mairson et al. - 1987  ACM   DBLP
32   Department of Computer Science (context) - Maher, Logic et al. - 1985
31   Magic sets and bottom-up evaluation of well-founded models - Kemp, Srivastava et al. - 1991  DBLP
30   The sharing of structure in theorem-proving programs (context) - Boyer, Moore - 1972
30   Database updates in logic programming (context) - Naqvi, Krishnamurthy - 1988  ACM   DBLP
29   Towards an open architecture for LDL - Chimenti, Gamboa et al. - 1989  ACM
29   Implementing large production systems in a DBMS environment (context) - Sellis, Lin et al. - 1988
28   Prooftree transformation theorems and their applications (context) - Ramakrishnan, Sagiv et al. - 1989
28   Rule ordering in bottom-up fixpoint evaluation of logic prog.. - Ramakrishnan, Srivastava et al. - 1990  ACM   DBLP
26   The Alexander method --- a technique for the processing of r.. (context) - Rohmer, Lescoeur et al. - 1986
26   Efficient evaluation of right (context) - Naughton, Ramakrishnan et al. - 1989
25   Polynomial time query processing in temporal deductive datab.. - Chomicki - 1990  ACM   DBLP
24   Data independent recursion in deductive databases (context) - Naughton - 1989  ACM   DBLP
21   Argument reduction through factoring (context) - Naughton, Ramakrishnan et al. - 1989
21   Recursive axioms in deductive databases: The query-subquery .. (context) - Vieille - 1986
21   Optimizations of bottom-up evaluation with non-ground terms (context) - Sudarshan, Ramakrishnan - 1992  ACM   DBLP
21   Optimizing existential Datalog queries (context) - Ramakrishnan, Beeri et al. - 1988
21   Bottom-up evaluation of logic programs (context) - Naughton, Ramakrishnan - 1991  DBLP
20   Duplicates and aggregates in deductive databases (context) - Mumick, Pirahesh et al. - 1990
20   Efficient bottom-up computation of queries on stratified dat.. (context) - Balbin, Port et al.
20   Magic is relevant - Mumick, Finkelstein et al. - 1990  ACM   DBLP
20   a short overview (context) - Vieille, Bayer et al. - 1990
20   A framework for the parallel processing of Datalog queries (context) - Ganguly, Silberschatz et al. - 1990  ACM   DBLP
20   The generalized counting methods for recursive logic queries - Sacca, Zaniolo - 1986
19   Modular acyclicity and tail recursion in logic programs (context) - Ross - 1991  ACM   DBLP
19   Aggregative closure: An extension of transitive closure (context) - Cruz, Norvell - 1989
17   Decidability and undecidability results for boundedness of l.. (context) - Vardi - 1988  ACM   DBLP
17   Querying a rule base (context) - Cholvy, Demelombe - 1986
17   Database complete proof procedures based on SLD-resolution (context) - Vieille - 1987
15   A deductive database system (context) - Phipps, Derr et al. - 1991
15   SEAVE: The mechanism for verifying user presuppositions (context) - Motro - 1986
15   Bottom-Up Revisited (context) - Ramakrishnan, Sudarshan - 1991
15   Bottom-Up Revisited (context) - Ramakrishnan, Sudarshan - 1992
15   Query evaluation and recursion in deductive database systems (context) - Bayer - 1985
15   Monocopy and associative algorithms in an extended lisp (context) - Goto - 1974
14   From QSQ towards QoSaQ: Global optimizations of recursive qu.. (context) - Vieille - 1988
13   Yet Another Window on NAIL (context) - Morris, Naughton et al. - 1987
13   Towards an algebraic theory of recursion - Ioannidis, Wong - 1988  ACM   DBLP
12   Why a single parallelization strategy is not enough in knowl.. (context) - Cohen, Wolfson - 1989  ACM   DBLP
11   A necessary and sufficient condition to linearize doubly rec.. (context) - Zhang, Yu et al. - 1988
11   and Raghu Ramakrishnan (context) - Mumick, Finkelstein et al. - 1990
10   A decidable class of bounded recursions (context) - Naughton, Sagiv - 1987  ACM   DBLP
9   A hashing method for fast set operations (context) - Sassa, Goto - 1976  DBLP
9   Integrity checking and materialized views handling by update.. (context) - Vieille, Bayer et al. - 1991
9   Sharing the load of logic program evaluations (context) - Wolfson, Silberschatz - 1989
9   A framework for an efficient implementation of deductive dat.. (context) - Kifer, Lozinskii - 1986
8   A message passing framework for logical query evaluation (context) - Van Gelder - 1986  ACM   DBLP
8   Coral: A database programming language (context) - Ramakrishnan, Bothner et al. - 1990
8   Compiling separable recursions (context) - Naughton - 1988  ACM   DBLP
8   Efficient query answering on stratified databases (context) - Kerisit, Pugin - 1988  DBLP
7   Detecting and eliminating redundant derivations in deductive.. (context) - Helm - 1988
6   Linearizing nonlinear recursions in polynomial time (context) - Saraiya - 1989  DBLP
6   Parallelism in logic programs - Ramakrishnan - 1990  ACM   DBLP
6   ej'a vu in fixpoints of logic programs (context) - Maher, Ramakrishnan - 1990
6   Processing recursive queries in relational algebra (context) - Apers, Houtsma et al. - 1986  DBLP
5   SYGRAF: Implementing logic programs in a database style (context) - Kifer, Lozinskii - 1988  DBLP
5   Space optimization in the bottom-up evaluation of logic prog.. - Sudarshan, Srivastava et al. - 1991  ACM   DBLP
4   An optimization strategy for recursive queries in logic data.. (context) - Sippu, Soisalon-Soinen - 1988
4   Efficient implementation of loops in bottom-up evaluation of.. (context) - Kuittinen, Nurmi et al. - 1990  ACM   DBLP
4   Meta-Level Control for Deductive Database Systems (context) - Schmidt - 1991  ACM
4   Minimizing expansions of recursions (context) - Naughton, Sagiv - 1989
2   On distributed processing of Datalog queries by decomposing .. (context) - Dong - 1986
2   An overview of DDC: Delta Driven Computer (context) - Gonzalez-Rubio, Rohmer et al. - 1987  ACM   DBLP
2   Valid computations and the Magic implementation of stratifie.. (context) - Beeri, Ramakrishnan et al.
1   How to forget the past without 36 RAGHU RAMAKRISHNAN (context) - Naughton, Ramakrishnan - 1990
1   and multi-linear rule EFFICIENT BOTTOM-UP EVALUATION OF LOGI.. (context) - Kemp, Ramamohanarao et al. - 1990
1   Controlling the search EFFICIENT BOTTOM-UP EVALUATION OF LOG.. (context) - Ramakrishnan, Srivastava et al. - 1991
1   Bounded recursion in deductive databases (context) - Ioannidis - 1986
1   Quantitative deduction and its fipoint theory (context) - Van Emden - 1986



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