On the properties of extended inclusion dependences

New classes of inclusion dependences are proposed as an extension of `generalization' based on the entity and association concept. Various kinds of extensions are discussed, and four classes (IND, IXG, UXG, and co-EXD) are evaluated from the viewpoint of database design. The complete inference axioms for each class and the polynomial of inference problems are presented.

[1]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Richard L. Sites,et al.  Programming tools: statement counts and procedure timings , 1978, SIGP.

[4]  Robert Demolombe.  Assigning Meaning to Ill-Defined Queries Expressed in Predicate Caculus Language , 1979, Advances in Data Base Theory.

[5]  Shamkant B. Navathe,et al.  View representation in logical database design , 1978, SIGMOD Conference.

[6]  Elliott Mendelson,et al.  Introduction to mathematical logic (3. ed.) , 1987 .

[7]  Catriel Beeri,et al.  Comprehensive Approach to the Design of Relational Database Schemes , 1984, VLDB.

[8]  William Kent,et al.  Choices in Practical Data Design , 1982, VLDB.

[9]  Edward Sciore.  Inclusion dependencies and the universal instance , 1983, PODS '83.

[10]  Donald E. Knuth,et al.  An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..

[11]  Marco A. Casanova,et al.  Mapping Uninterpreted Schemes into Entity-Relationship Diagrams: Two Applications to Conceptual Schema Design , 1984, IBM J. Res. Dev..

[12]  David R. Hanson,et al.  Measuring the Performance and Behavior of Icon Programs , 1983, IEEE Transactions on Software Engineering.

[13]  Ronald Fagin,et al.  Inclusion dependencies and their interaction with functional dependencies , 1982, PODS.

[14]  Marco A. Casanova,et al.  Towards a sound view integration methodology , 1983, PODS.

[15]  Richard T. Snodgrass,et al.  Monitoring in a software development environment: A relational approach , 1984, SDE 1.

[16]  Ronald Fagin,et al.  An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic , 1981, JACM.

[17]  Edwin H. Satterthwaite.  Debugging tools for high level languages , 1972, Softw. Pract. Exp..

[18]  Paolo Atzeni,et al.  Formal Properties of Net-Based Knowledge Representation Schemes , 1986, ICDE.

[19]  Eric Foxley,et al.  Monitoring the run‐time activity of algol 68‐R programs , 1978, Softw. Pract. Exp..

[20]  Catriel Beeri,et al.  Compatible attributes in a universal relation , 1982, PODS '82.

[21]  Peter P. Chen.  The Entity-Relationship Model: Towards a unified view of Data , 1976 .

[22]  Moshe Y. Vardi,et al.  Unary inclusion dependencies have polynomial time inference problems , 1983, STOC '83.

[23]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

[24]  Diane C. P. Smith,et al.  Database abstractions: aggregation and generalization , 1977, TODS.

[25]  Takao Miura,et al.  Operations and the Properties on Non-First-Normal-Form Relational Databases , 1983, VLDB.

[26]  Hiroshi Arisawa.  A Conceptual Design of a Database Machine based on a New Data Model , 1979, ER.

[27]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.