C.-C. Yang, Relational databases. Prentice Hall, Englewood Cliffs, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Overview on Semantical Constraints for Database Models - Thalheim (1996) (1 citation) (Correct)
....development and the improvement of relational database systems manifest the application of several theories. Simplification of algorithms. It is very important for large databases to get al..gorithms with appropriate time complexity functions. Further reading A survey on normalization is given in [PDG89, Ull89, Yan86], for horizontal normalization in [Heg88, PDG89] A novel approach to normalization has been presented in [Bis95, Vin94] The last paper shows that normalization is still not very well understood. Most of the books on the entity relationship model can be used as a source on approaches to vertical ....
C.-C. Yang, Relational databases. Prentice Hall, Englewood Cliffs, 1986.
Transportation and Logistics: Models and Algorithms - Gallo (Correct)
....labelled graphs and AndOr graphs. Directed hypergraphs are a powerful tool not only in modelling but also in solving several relevant problems in areas such as linear production problems, 1 exible manufacturing systems, propositional logic, relational databases, and public transportation systems [42, 21, 26]. Nondi erentiable Optimization Minimizing a convex function which does not possess continuous derivatives is a rather dicult task which is required in many applications. One traditional approach is the subgradient method. Of quite simple implementation, it su ers from a number of important ....
Yang C.C. Relational Databases, Prentice-Hall, Englewood Cli s, NJ, 1986 9
jRelix: An Implementation of a Relational Database Engine in Java - Yuan (1998) (Correct)
....by Ullman [Ull82] and by Date [Dat81] while several others have presented informal outlines of it [Gra85] Ken83] KS86] Sal86] Yao [Yao85] and Ceri et al. CG86] have summarized the various normalization algorithms that are available, including some of their own modifications. Yang [Yan86] has discussed a graph theoretic approach to normalization. While conformance to the first normal form depends on the design of the database software, conformance to the higher normal forms depends on the database schema. With any relational database software, the designer can devise a schema ....
C. C. Yang. Relational Databases. Prentice-Hall, Englewood Cliffs, NJ, 1986.
Experimentation-Driven Knowledge Acquisition for Planning - Tae, Cook, Holder (Correct)
....space, but these techniques only handle symbols. One of the problems is that it is hard to know which sensor is irrelevant to an operator in advance instead, the symbol may be more appropriately used to represent unknown or noisy data, similar to the use of null values in databases [24, 14]. In our approach, is not provided in a state description. We deduce by experimenting with two opposite cases: if both states, A B) and (A not B) have the same e ect on an operator, then B is irrelevant to the operator and we can deduce (A ) Since we can deduce , the size of search ....
C. C. Yang. Relational Databases. Prentice Hall, Englewood Cli s, NJ, 1986. 45
An Overview on Semantical Constraints for Database Models - Thalheim (1996) (1 citation) (Correct)
....development and the improvement of relational database systems manifest the application of several theories. Simplification of algorithms. It is very important for large databases to get al..gorithms with appropriate time complexity functions. Further reading A survey on normalization is given in [PDG89, Ull89, Yan86], for horizontal normalization in [Heg88, PDG89] A novel approach to normalization has been presented in [Bis95, Vin94] The last paper shows that normalization is still not very well understood. Most of the books on the entity relationship model can be used as a source on approaches to vertical ....
C.-C. Yang, Relational databases. Prentice Hall, Englewood Cliffs, 1986.
Directed Hypergraphs And Applications - Gallo, Longo, Nguyen, Pallottino (1992) (6 citations) (Correct)
....X and Y subsets of N, defines uniquely the value of the attributes in Y once the value of the attributes in X is given. A set of Functional Dependencies together with some inference rules allows us to derive new facts from that explicitly stored in the data base. Typical inference rules are (see Yang (1986, 1989) i) reflexivity: F(X,Y) if Y X; ii) transitivity: F(X,Z) if F(X,Y) and F(Y,Z) iii) conjunction: F(X,Y Z) if F(X,Y) F(X,Z) Given a set of Functional Dependencies, F, we might need to solve problems such as: a) find whether a given Functional Dependency F(X,Y) F can be derived from F ....
Yang, C.C.: Relational Databases, Prentice-Hall, Englewood Cliffs, NJ (1986).
System Performance Advisor: An Expert System For Unix System.. - Hoogenboom (1992) (1 citation) (Correct)
....shell command: shell df 27 2.4.1.1 The select Command The select command is used to query the knowledge base. The show command is also used for this purpose, but the select command is more useful because it allows querying the knowledge base in the fashion of a relational database [12, 15, 62]. That is, the user can specify what kinds of knowledge base objects to search (e.g. host or process) what slots of the requested objects to display, and a relation that must evaluate to true for each instance of the knowledge base objects that is a member of the displayed result. The select ....
Yang, C.-C. Relational Databases. Prentice-Hall, Englewood Cliffs, New Jersey, 1986.
On the Design of an Indexical Query Language - Paquet, Plaice (1994) (1 citation) (Correct)
No context found.
Chao-Chin Yang. Relational Databases. Prentice-Hall, 1986.
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