| |
Browse All Reviews > Information Systems (H) > Database Management (H.2) > Logical Design (H.2.1) > Normal Forms (H.2.1...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 15
Reviews about "Normal Forms (H.2.1...)":
|
Date Reviewed |
| |
Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
Gyssens M., Suciu D., Van Gucht D. Information and Computation 164(1): 85-117, 2001. Type: Article
The topic of this paper is relational schemes for which the requirement of first normal form has been weakened in certain ways. Rather than be restricted to atomic attribute values, relations are permitted to have attribute values that...
|
Oct 1 2001 |
| |
Object normal forms and dependency constraints for object-oriented schemata
Tari Z., Stokes J., Spaccapietra S. (ed) ACM Transactions on Database Systems 22(4): 513-569, 1997. Type: Article
Although relational design theory is nearly as old as the relational model itself, it has been extended in different directions. One is non–first normal form data models, especially nested normal form. Another is mappings fro...
|
Feb 1 1999 |
| |
A normal form for precisely characterizing redundancy in nested relations
Mok W., Ng Y., Embley D. ACM Transactions on Database Systems 21(1): 77-106, 1996. Type: Article
The setting for this paper is relational schemes that are not in first normal form (non-1NF), that is, those with attributes that are not necessarily atomic. Although Codd foresaw their potential [1], most interest in non-1NF databases...
|
May 1 1997 |
| |
Reasoning about functional dependencies generalized for semantic data models
Weddell G. ACM Transactions on Database Systems 17(1): 32-64, 1992. Type: Article
A new, more general form of functional dependency constraint for semantic data models (SDMs), called a path functional dependency (PFD), is described. The relational notions of relation and domain are combined into a single notion of c...
|
Jun 1 1993 |
| |
Simple conditions for guaranteeing higher normal forms in relational databases
Date C., Fagin R. ACM Transactions on Database Systems 17(3): 465-476, 1992. Type: Article
The hierarchy of normal forms for schema design by decomposition using only projection and join was completed by Fagin in 1979 with his description of projection-join normal form (PJ/NF, also called 5NF) [1]. More than a decade later, ...
|
Jun 1 1993 |
| |
Independence-reducible database schemes
Chan E., Hernández H. Journal of the ACM 38(4): 854-886, 1991. Type: Article
Chan and Hernández define key equivalent independence-reducible database schemes, a generalized form of Sagiv-independent database schemes. In addition, they demonstrate that this class of schemes is highly desirable with resp...
|
Aug 1 1992 |
| |
Polynomial-time implication problems for unary inclusion dependencies
Cosmadakis S., Kanellakis P. (ed), Vardi M. Journal of the ACM 37(1): 15-46, 1990. Type: Article
This research paper in database theory presents results on the decidability of implication of unary inclusion dependencies (UINDs), embedded implicational dependencies (EIDs), and several of their subclasses. The subclasses include fun...
|
Mar 1 1991 |
| |
Testing unboundedness of database schemes and functional dependencies
Edward P., Héctor J. Information Processing Letters 28(6): 317-326, 1988. Type: Article
The weak instance model was initially defined to enforce data dependencies globally on a database [1]. One application of this model is to use the representative instance to answer queries. This application of the weak instance ...
|
Jul 1 1989 |
| |
On finding a worst-case optimal fourth normal form database decomposition
Loizou G., Thanisch P. BIT 27(2): 157-162, 1987. Type: Article
Let U = ⟨ A 1 ,..., A n ⟩ be a set of attributes and let d = ⟨ r 1 ,..., r k ⟩ be a set of relations over U<...
|
Jun 1 1989 |
| |
On bounded database schemes and bounded Horn-clause programs
Sagiv Y. (ed) SIAM Journal on Computing 17(1): 1-12, 1988. Type: Article
Normalization of databases generally entails the decomposition of the original relations. Even though the new relations are physically stored, the original relations remain a correct representation of the database. One method of obtain...
|
Apr 1 1989 |
| |
|
|
| |
|
|
