J. Han, Compilation-Based List Processing in Deductive Databases, in A. Pirotte, C. Delobel and G. Gottlob (eds.), Extending Database Technology - EDBT'92 [Lecture Notes in Computer Science 580], Springer-Verlag, 1992, 104-119.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....these methodologies enforce strong restrictions on the ordering of the predicates rules in a given program, which is not declarative programming in a rigorous sense. Efficient implementations of deductive database programs have been studied extensively in recent deductive database research [1, 2, 3, 6, 10, 22]. Besides algorithms for evaluation of function free Datalog programs, such as partial transitive closure algorithms [11] Magic Sets and Counting [1] etc. other interesting techniques have also been developed for evaluation of logic programs involving relatively sophisticated functions and ....

....algorithms for evaluation of function free Datalog programs, such as partial transitive closure algorithms [11] Magic Sets and Counting [1] etc. other interesting techniques have also been developed for evaluation of logic programs involving relatively sophisticated functions and queries [4, 23, 22, 6, 16]. The work was supported in part by the Natural Sciences and Engineering Research Council of Canada under the grant OPG3723 and a research grant from the Centre for Systems Science of Simon Fraser University. The method and the examples described in the paper have been implemented in the ....

[Article contains additional citation context not shown here]

J. Han. Compilation-based list processing in deductive databases. In A. Pirotte, C. Delobel, and G. Gottlob, editors, Extending Database Technology - EDBT'92 [Lecture Notes in Computer Science 580], pages 104--119. Springer-Verlag, 1992.

.... Introduction Constraint programming and constraint based reasoning has been studied extensively in logic programming and artificial intelligence [12, 13] Since many application problems in deductive databases, such as traversal recursion [24] the manipulation of lists and complex data objects [9], etc. may involve huge search space and may encounter termination problems, it is important to explore constraint based query evaluation in deductive databases [15, 16] Relational database query optimizers apply query constants and constraint information for efficient retrieval [27] A popular ....

....is illustrated using some simple linear recursion problems. However, the principles developed here are useful for a large set of deductive database and logic programming problems defined by linear recursions, nested linear recursions, or recursions compilable into highly regular chain forms [9]. It is an interesting research issue to further develop the constraint based query evaluation technique to handle recursions containing aggregation functions and more complex forms of recursions not compilable into highly regular chain forms. 15 References ....

J. Han, Compilation-Based List Processing in Deductive Databases, in A. Pirotte, C. Delobel and G. Gottlob (eds.), Extending Database Technology - EDBT'92 [Lecture Notes in Computer Science 580], Springer-Verlag, 1992, 104-119.

....logic programming, declarative programs, implementation techniques, recursive query evaluation, nonlinear recursion, regular nonlinear recursion. 1. INTRODUCTION Efficient evaluation of different kinds of recursions has been studied extensively in deductive database and logic programming research [14, 1, 2, 4, 42, 22, 31, 39, 11]. Some interesting query evaluation techniques, such as transitive closure algorithms [16, 18] magic sets [1] counting [1] generalized magic sets [4] generalized counting [4] query subquery approach [42] etc. have been proposed and implemented for efficient evaluation of different kinds of ....

....function symbols [38, 9, 39, 27] It is important to perform a systematic study on the efficient evaluation of function bearing recursions (called functional recursions) in both data intensive and logic intensive programs. In recent studies of compilation and evaluation of functional recursions [23, 22, 11], some interesting techniques have been proposed for the evaluation of linear and nested linear functional recursions. A subclass of nonlinear recursions can be transformed into linear or multiple linear recursions [35, 33, 43, 25] Clearly not all nonlinear recursions can be transformed into ....

[Article contains additional citation context not shown here]

J. Han. Compilation-based list processing in deductive databases. In A. Pirotte, C. Delobel, and G. Gottlob, editors, Extending Database Technology - EDBT'92 [Lecture Notes in Computer Science 580], pp. 104--119. Springer-Verlag (1992).

....way but also demonstrates the power of the deductive database approach in the analysis and evaluation of sophisticated logic programs. 1 Introduction Efficient evaluation of different kinds of recursions has been studied extensively in deductive database and logic programming research [13, 1, 2, 4, 41, 21, 30, 38, 11]. Some interesting query evaluation techniques, such as transitive closure algorithms [15, 17] magic sets [1] counting [1] generalized magic sets [4] generalized counting [4] query subquery approach [41] etc. have been proposed and implemented for efficient evaluation of different kinds of ....

....function symbols [37, 9, 38, 26] It is important to perform a systematic study on the efficient evaluation of function bearing recursions (called functional recursions) in both data intensive and logic intensive programs. In recent studies of compilation and evaluation of functional recursions [22, 21, 11], some interesting techniques have been proposed for the evaluation of linear and nested linear functional recursions. A subclass of nonlinear recursions can be transformed into linear or multiple linear recursions [34, 32, 42, 24] Clearly not all nonlinear recursions can be transformed into ....

[Article contains additional citation context not shown here]

J. Han. Compilation-based list processing in deductive databases. In A. Pirotte, C. Delobel, and G. Gottlob, editors, Extending Database Technology - EDBT'92 [Lecture Notes in Computer Science 580], pages 104--119. Springer-Verlag, 1992.

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