13 citations found. Retrieving documents...
Morris, K. et al. "YAWN! (Yet Another Window on Nail!), Data Engineering, Vol.10, No. 4, pp. 28--44, Dec. 1987.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The LDL System Prototype - Chimenti, Gamboa, Krishnamurthy.. (1990)   (33 citations)  (Correct)

....emerged from this experience, along with various ideas for desirable improvements. 1. 2 Structure of the Paper Section 2 summarizes key techniques and concepts implemented in the system most of them novel and untried techniques developed by the LDL researchers or by parallel e#orts, such as [Meta]. Thus, Section 2.1 gives a brief survey of the novel features of the language, while 2.2 summarizes the rule compilation techniques for constant pushing and e#cient implementation of recursion. Section 2.3 describes the various execution schemes supported by the system, while 2.4 describes the ....

Morris, K. et al. "YAWN! (Yet Another Window on Nail!), Data Engineering, Vol.10, No. 4, pp. 28--44, Dec. 1987.


Propagating Constraints in Recursive Deductive Databases - Kemp (1989)   (13 citations)  (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. Morris, J. F. Naughton, Y. Saraiya, J. D. Ullman, and A. van Gelder. Yawn! (yet another window on nail!). IEEE Data Engineering, 10(4):28--43, December 1987.


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

....to us as researchers when we investigate optimization methods and evaluation algorithms. Eventually, of course, we intend to distill the results of these investigations into code that automatically selects the best set of optimizations for each predicate in the program (like the strategy module of [18]) Aditi Prolog programs may include disjunction and negation. Like most deductive databases, Aditi currently supports only stratified forms of negation. However, this may change in the future, since we have developed a practical algorithm for computing answers to queries even in the presence of ....

K. Morris, J. F. Naughton, Y. Saraiya, J. D. Ullman, and A. V. Gelder. YAWN! (yet another window on NAIL! IEEE Data Engineering, 10(4):28--43, December 1987.


The LDL System Prototype - Chimenti, Gamboa, Krishnamurthy.. (1996)   (33 citations)  (Correct)

....emerged from this experience, along with various ideas for desirable improvements. 1. 2 Structure of the Paper Section 2 summarizes key techniques and concepts implemented in the system most of them novel and untried techniques developed by the LDL researchers or by parallel efforts, such as [Meta]. Thus, Section 2.1 gives a brief survey of the novel features of the language, while 2.2 summarizes the rule compilation techniques for constant pushing and efficient implementation of recursion. Section 2.3 describes the various execution schemes supported by the system, while 2.4 describes the ....

Morris, K. et al. "YAWN! (Yet Another Window on Nail!), Data Engineering, Vol.10, No. 4, pp. 28--44, Dec. 1987.


Design and Implementation of the Glue-Nail Database System - Derr, Morishita, Phipps (1993)   (37 citations)  (Correct)

....1 Introduction The Glue Nail database system [15] provides two complementary languages for programming deductive database applications. The Glue procedural language [14] augments relational style queries with control structures, update operations, and I O. The Nail declarative language [11, 12] provides rules for expressing complex recursive queries or views. The purpose of this paper is to describe the design and implementation of the Glue Nail database system. In particular we focus on how we optimized the output or the performance for each major component of the system. We present ....

K. Morris, J. F. Naughton, Y. Saraiya, J. D. Ullman, and A. Van Gelder. YAWN! (Yet Another Window on NAIL!). Data Engineering, 10(4):28--43, 1987.


Next Generation Database Management Systems Technology - Michael Brodie (1989)   (3 citations)  (Correct)

....is grouped by objects. The second axis is for the programming paradigm with declarative and the imperative programming modes at the extremes. Together the axes classify four language types. Pascal R and GLUE (NAIL 2) are imperative relational languages. Deductive database languages, such as NAIL [MNSU87] or LDL [NT89] are declarative relational languages. OO DBMS (e.g. O2, Ontos) are imperative OO languages. The fourth, and a new language class is both declarative (or deductive) and OO (DOOD) DOOD includes such languages as F logic [KL89] O logic [KW89] C logic [CW89] and to a certain ....

K. Morris, J. Naughton, Y. Saraiya, J. Ullman, and A. Van Gelder, YAWN! (yet another window on NAIL!), Technical Memo, Computer Science Dept., Stanford University, 1987


The Glue-Nail Deductive Database System: Design.. - Derr, Morishita, Phipps   (Correct)

....database system [9, 26] which was developed at Stanford University, provides two complementary languages for programming such applications. The Glue procedural language [24, 25] augments relational style queries with control structures, update operations, and I O. The Nail declarative language [20, 21] provides rules for expressing complex recursive queries or views. The purpose of this paper is to describe the design and implementation of the Glue Nail database system. In particular we focus on how we optimized the output or the performance of each major component of the system. We describe a ....

....of these optimizations. We also compare a Glue Nail application with a version written in C and evaluate the design of Glue based on our experiences with the system. We begin by reviewing the background and philosophy underlying the design of the Glue Nail system. Glue Nail evolved from NAIL [20, 21], a deductive database system, which featured a logicbased query language, Nail. 1 Logic based query languages such as Nail have proven to be powerful query languages. However, being based on logic is both a strength and weakness of Nail. It is a strength, because logic is declarative and ....

Katherine Morris, Jeffrey F. Naughton, Yatin Saraiya, Jeffrey D. Ullman, and Allen Van Gelder. YAWN! (Yet Another Window on NAIL!). Data Engineering, 10(4):28--43, 1987.


Intelligent Databases: Old Challenges and New Opportunities - Zaniolo (1992)   (4 citations)  (Correct)

....not well suited for an implementation based on secondary store. Because of the problems just mentioned, many of the deductive database projects, started in the mid 80 s, such as LDL, Nail and Lola, chose to support Horn clauses and logic rules using extensions of relational database technology [Meta, Seta, KiMS]. These projects thus abandoned SLD resolution in favor of a bottomup (fixpoint based) approach [Meta, Seta, KiMS] Deductive Databases represent the first major research trend of the 80s in the area of databases and programming languages. This research is motivated by the desire of providing an ....

.... the deductive database projects, started in the mid 80 s, such as LDL, Nail and Lola, chose to support Horn clauses and logic rules using extensions of relational database technology [Meta, Seta, KiMS] These projects thus abandoned SLD resolution in favor of a bottomup (fixpoint based) approach [Meta, Seta, KiMS]. Deductive Databases represent the first major research trend of the 80s in the area of databases and programming languages. This research is motivated by the desire of providing an intelligent database environment that builds on a rule based language capable of expressing advanced applications ....

[Article contains additional citation context not shown here]

Morris, K. et al. "YAWN! (Yet Another Window on NAIL!), Data Engineering, Vol.10, No. 4, pp. 28--44, Dec. 1987.


A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993)   (34 citations)  Self-citation (Ullman)   (Correct)

No context found.

Katherine Morris, Jeffrey F. Naughton, Yatin Saraiya, Jeffrey D. Ullman, and Allen Van Gelder. YAWN! (Yet Another Window on NAIL!). Database Engineering, December 1987.


Overbound and Right-Linear Queries - Mumick, Pirahesh (1991)   (5 citations)  (Correct)

No context found.

Katherine A. Morris, Jeffrey F. Naughton, Yatin Saraiya, Jeffrey D. Ullman, and Allen Van Gelder. Yawn! (yet another window on nail!). In Data Engineering 10:4, pages 28--43, 1987.


One-Phase Magic-sets Transformation (Extended Abstract) - Mumick (1994)   (Correct)

No context found.

Katherine A. Morris, Jeffrey F. Naughton, Yatin Saraiya, Jeffrey D. Ullman, and Allen Van Gelder. Yawn! (yet another window on nail!). In Data Engineering 10:4, pages 28--43, 1987.


Efficient Bottom-Up Evaluation Of Logic Programs - Ramakrishnan, Srivastava.. (1992)   (12 citations)  (Correct)

No context found.

Katherine Morris, Jeffrey F. Naughton, Yatin Saraiya, Jeffrey D. Ullman, and Allen Van Gelder. YAWN! (Yet Another Window on NAIL!). Database Engineering, December 1987.


Implementation of Magic-sets in a Relational Database System - Mumick (1994)   (6 citations)  (Correct)

No context found.

K. Morris, J. Naughton, Y. Saraiya, J. Ullman, and A. Van Gelder. YAWN! (Yet Another Window on Nail!). In Data Engineering 10:4, 1987.

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