Hierarchical schemata for relational databases
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
On the Equivalence of Database Models
Journal of the ACM (JACM)
A Comparison of the Relational and CODASYL Approaches to Data-Base Management
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Design of relational views over network schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Database states and their tableaux
ACM Transactions on Database Systems (TODS)
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
On Kent's “Consequences of assuming a universal relation” (Technical correspondance)
ACM Transactions on Database Systems (TODS)
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Designing globally consistent network schemas
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Attributed grammars for query language translations
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Combining relational and network retrieval methods
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Universal Relation Views: A Pragmatic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
We describe a network schema design algorithm that uses a well-designed relational schema as input. The resulting network database handles incomplete information, since we use only the modified foreign-key constraint and not the universal instance assumption. We believe that the representative instance is a correct representation of information stored in the database. We show how to map the representative instance to the network database. We give two algorithms for translating a relational query to a network application program. The first algorithm is confined to relational queries that express selections and projections over the universal relation scheme. The second algorithm includes all relational queries over select, project and (natural) join. Optimization techniques are discussed for both types of translation.