4 citations found. Retrieving documents...
K. Ramamohanarao et al. The NU-Prolog deductive database system. In Prolog and Databases: Implementations and New Directions, pages 212--250, 1988.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Scheduling Strategies for Evaluation of Recursive Queries over.. - Silva (1997)   (Correct)

....triggers, as a means of integrating deductive and relational databases. This approach is not general enough, given the idiosyncrasies of different RDBMS implementations (e.g. in Oracle 7. 1, triggers are restricted to a maximum cascading depth of 32) Systems such as EDUCE [Boc86] and NU Prolog [Ram88] integrated existing Prolog systems with commercial relational databases (in [CGT90] Ceri et CHAPTER 9. RELATED WORK 143 al give an overview of the issues involved in coupling logic programming and database systems) but there are a number of problems with this approach: 1) Prolog can go into ....

K. Ramamohanarao et al. The NU-Prolog deductive database system. In Prolog and Databases: Implementations and New Directions, pages 212--250, 1988.


Scheduling Strategies for Evaluation of Recursive Queries over.. - Silva (1997)   (Correct)

....triggers, as a means of integrating deductive and relational databases. This approach is not general enough, given the idiosyncrasies of different RDBMS implementations (e.g. in Oracle 7. 1, triggers are restricted to a maximum cascading depth of 32) Systems such as EDUCE [Boc86] and NU Prolog [Ram88] integrated existing Prolog systems with commercial relational databases (in [CGT90] Ceri et al. give an overview of the issues involved in coupling logic programming and database systems) but there are a number of problems with this approach: 1) Prolog can go into infinite loop for Datalog ....

K. Ramamohanarao et al. The NU-Prolog deductive database system. In Prolog and Databases: Implementations and New Directions, pages 212--250, 1988.


Propagating Constraints in Recursive Deductive Databases - Kemp (1989)   (13 citations)  Self-citation (Ramamohanarao Balbin)   (Correct)

....of large quantities of data. When inferring answers to a query on a database, a bottom up computation can naturally employ the existing optimisation techniques developed for relational databases. As a consequence, bottom up computation is the focus of much research into deductive databases [3, 6, 2, 16, 17, 13, 14]. A well known problem with bottom up computation is that it does not naturally make use of ground terms in a literal in the same goal driven way that a top down computation does. A direct consequence is that many irrelevant facts may be generated during a bottom up computation. The magic set ....

....or program. Without loss of generality, a deductive database D (or simply database) is a finite set of rules consisting of a program P and a set of facts F. It is assumed in the rest of this paper that the reader is familiar with the adornment and magic set transformations of deductive databases [3, 6, 2, 16, 17, 13, 14]. 2 Preliminaries 2.1 Safety One of the features of a positive, function free deductive database (Datalog) is that the Herbrand base is finite. The completeness of bottom up computation is a direct result. When a deductive database is extended to include numbers, arithmetic and constraining ....

K. Ramamohanarao, J. A. Shepherd, I. Balbin, G. S. Port, L. Naish, J. A. Thom, J. A. Zobel, and P. W. Dart. The nu-prolog deductive database system. IEEE Data Engineering, 10(4):10--19, December 1987.


The Aditi deductive database system - Vaghani, Ramamohanarao, Kemp.. (1990)   (38 citations)  Self-citation (Ramamohanarao)   (Correct)

....on relational technology wherever possible but with necessary modifications such as support for tuples not in first normal form. The upper layers are derived mostly from research specific to deductive databases. Many aspects in both layers build on original research by members of the Aditi team [1, 2, 7, 9, 10, 11, 12, 13, 23, 25]. Much of this research in turn used Aditi as a testbed in which to try out and evaluate ideas. Aditi is a true database system. It is disk based, it is multiuser, and it can exploit parallelism in the underlying machine. It has both textual and graphical user interfaces, including an interface ....

K. Ramamohanarao, J. Shepherd, I. Balbin, G. Port, L. Naish, J. Thom, J. Zobel, and P. Dart. The NU-Prolog deductive database system. In P. Gray and R. Lucas, editors, Prolog and databases, pages 212--250. Ellis Horwood, Chicester, England, 1988.

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