Jiawei Han, et al.  Home/Search
Context Related
| cs.concordia.ca/pu...nfoSystems94.ps.gz cs.concordia.ca/pu...nfoSystems94.ps.gz 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.concordia.ca/~faculty...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Nonlinear recursion is one of the most challenging classes of logic programs for efficient evaluation in logic programming systems. We identify one popular class of nonlinear recursion, regular nonlinear recursion, and investigate its efficient implementation by a deductive database approach. The approach performs a detailed query binding analysis based on query information, constraint information and the structure of a recursion, selects an appropriate predicate evaluation order and generates... (Update)
Context of citations to this paper: More
.... our method is also applicable to the evaluation of more general class of recursions such as nested linear and non linear recursions [12, 5]. Instead of transforming DOOD programs into Horn like programs, the DOOD programs are preprocessed into normalized forms. The...
.... a; b; c; a to b; a to c; b to c; a to b; c to a; c to b; a to b] can still be analyzed systematically and be evaluated efficiently [8]. However, this does not imply that chain based evaluation can be applied effectively to all kinds of recursions. This is because some...
Cited by: More
LogicBase: A Deductive Database System Prototype - Han, Liu, Xie (1994) (Correct)
Normalization and Compilation of Deductive and Object-Oriented.. - Xie, Han (1995) (Correct)
Similar documents (at the sentence level):
78.3%: Evaluation of Regular Nonlinear Recursions by Deductive.. - Han, Lakshmanan (1995) (Correct)
Active bibliography (related documents): More All
0.8: Constraint-Based Query Evaluation in Deductive Databases - Han (1994) (Correct)
0.6: Chain-Split Evaluation in Deductive Databases - Han (1995) (Correct)
0.6: Evaluation of Declarative N-Queens Recursion: A Deductive.. - Han, Liu, Lu (Correct)
Similar documents based on text: More All
0.5: From a Polynomial Riemann Hypothesis to Alternating Sign.. - Egecioglu, Redmond (Correct)
0.4: A Fixpoint Theory for Non-monotonic Parallelism - Chen (2001) (Correct)
0.3: Conjugate Gradient Algorithms Using Multiple Recursions - Barth, Manteuffel (1995) (Correct)
Related documents from co-citation: More All
2: HiLog: A Foundation for Higher-Order Logic Programming - Chen, Kifer et al. - 1989
2: Automatic generation of compiled forms for linear recursions (context) - Han, Zeng - 1992
2: XSB as an efficient deductive database engine - Sagonas, Swift et al. - 1994
BibTeX entry: (Update)
J. Han and L. V. S. Lakshmanan. Evaluation of regular nonlinear recursions by deductive database techniques. Information Systems, 20, 1995 (to appear). http://citeseer.ist.psu.edu/article/han95evaluation.html More
@article{ han95evaluation,
author = "Jiawei Han and Laks V. S. Lakshmanan",
title = "Evaluation of Regular Nonlinear Recursions by Deductive Database Techniques",
journal = "Information Systems",
volume = "20",
number = "5",
pages = "419--441",
year = "1995",
url = "citeseer.ist.psu.edu/article/han95evaluation.html" }
Citations (may not include all citations):981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989
561 Constraint logic programming (context) - Jaffar, Lassez - 1987
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
413 Logical foundations of object-oriented and frame-based langu.. - Kifer, Lausen et al. - 1993
204 Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
204 Querying object-oriented database - Kifer, Kim et al. - 1992
147 An amateur's introduction to recursive query processing stra.. (context) - Bancilhon, Ramakrishnan - 1986
121 the power of magic - Beeri, Ramakrishnan - 1987
115 Magic templates: A spellbinding approach to logic programs - Ramakrishnan - 1988
101 Hilog: A foundation for higher-order logic programming - Chen, Kifer et al. - 1993
46 Query evaluation in recursive databases: Bottom-up and top-d.. (context) - Bry - 1990
44 Efficient tests for top-down termination of logical rules (context) - Ullman, van Gelder - 1988
30 Intelligent query answering in rule based systems (context) - Imielinski - 1987
28 Expanding query power in constraint logic programming langua.. (context) - Maher, Stuckey - 1989
28 Proof-tree transformation theorems and their applications (context) - Ramakrishnan, Sagiv et al. - 1989
27 Termination detection in logic programs using argument sizes (context) - Sohn, van Gelder - 1991
27 Efficient transitive closure algorithms (context) - Ioannidis, Ramakrishnan - 1988
27 Safety of recursive Horn clauses with infinite relations (context) - Ramakrishnan, Bancilhon et al. - 1987
27 On compiling queries in recursive first-order databases (context) - Henschen, Naqvi - 1984
26 Efficient evaluation of right (context) - Naughton, Ramakrishnan et al. - 1989
25 Inference of inequality constraints in logic programs (context) - Brodsky, Sagiv - 1991
22 Deriving constraints among argument sizes in logic programs (context) - van Gelder - 1990
20 Propagating constraints in recursive deductive databases - Kemp, Ramamohanarao et al. - 1989
19 A framework for testing safety and effective computability o.. (context) - Krishnamurthy, Ramakrishnan et al. - 1988
16 A suitable algorithm for computing partial transitive closur.. (context) - Jiang - 1990
15 Bounds on the propagation of selection into logic programs (context) - Beeri, Kanellakis et al. - 1987
15 Termination proofs for logic programs based on predicate ine.. (context) - Plumer - 1990
14 From QSQ towards QoSaQ: Global optimization of recursive que.. (context) - Vieille - 1988
14 Deductive databases in action (context) - Tsur - 1991
11 LogicBase: A deductive database system prototype - Han, Liu et al. - 1994
11 Necessary and sufficient condition to linearize doubly recur.. (context) - Zhang, Yu et al. - 1990
10 Knowledge and Data Engineering (context) - Chimenti, Gamboa et al. - 1990
10 Optimization in a logic based language for knowledge and dat.. (context) - Krishnamurthy, Zaniolo - 1988
10 Safety of datalog queries over infinite databases (context) - Sagiv, Vardi - 1989
9 On termination of datalog programs (context) - Brodsky, Sagiv - 1989
8 Compiling separable recursions (context) - Naughton - 1988
7 Constraint-based reasoning in deductive databases (context) - Han - 1991
7 Automatic generation of compiled forms for linear recursions (context) - Han, Zeng - 1992
6 A Logical Data Language for Data and Knowledge Bases (context) - Naqvi, Tsur - 1989
6 Linearising nonlinear recursions in polynomial time (context) - Saraiya - 1989
4 Compilation-based list processing in deductive databases (context) - Han - 1992
3 Homomorphic tree embeddings and their applications to recurs.. - Lakshmanan, Ashraf et al. - 1993
2 An axiomatic approach to deciding finiteness of queries in d.. (context) - Kifer, Ramakrishnan et al. - 1988
Documents on the same site (http://www.cs.concordia.ca/~faculty/laks/papers.html): More
An Epistemic Foundation for Logic Programming with Uncertainty - Lakshmanan (1994) (Correct)
nD-SQL: A Multi-dimensional Language for Interoperability and .. - Gingras, Lakshmanan (1998) (Correct)
Canonical Kripke Models and The Intuitionistic Semantics of.. - Dong, al. (1993) (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