A simplied universal relation assumption and its properties
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)
Extending the database relational model to capture more meaning
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)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
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
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Constant time maintenance or the triumph of the FD.
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A message passing framework for logical query evaluation
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Answering queries on embedded-complete database schemes
Journal of the ACM (JACM)
Database theory—past and future
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dynamic query interpretation in relational databases
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A new basis for the weak instance model
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Update and retrieval in a relational database through a universal schema interface
ACM Transactions on Database Systems (TODS)
A characterization of constant-time maintainability for BCNF database schemes
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Efficient optimization of simple chase join expressions
ACM Transactions on Database Systems (TODS)
Updating databases in the weak instance model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Can constant-time-maintainability be more practical?
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
View updates in relational databases with an independent scheme
ACM Transactions on Database Systems (TODS)
Polynomial time designs toward both BCNF and efficient data manipulation
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient updates to independent schemes in the weak instance model
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Evaluation of queries in independent database schemes
Journal of the ACM (JACM)
Constant-time-maintainable BCNF database schemes
ACM Transactions on Database Systems (TODS)
Independence-reducible database schemes
Journal of the ACM (JACM)
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
Updating relational databases through weak instance interfaces
ACM Transactions on Database Systems (TODS)
Semantics for null extended nested relations
ACM Transactions on Database Systems (TODS)
Regular Article: The nested universal relation data model
Proceedings of the 30th IEEE symposium on Foundations of computer science
An integrated approach to logical design of relational database schemes
ACM Transactions on Database Systems (TODS)
Perspectives on database theory
ACM SIGACT News
Independence-reducible database schemes
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
A high-level user interface for update and retrieval in relational databases—language aspects
SIGMOD '85 Proceedings of the 1985 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
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimal computation of total projections with unions of simple chase join expressions
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Comprehensive Approach to the Design of Relational Database Schemes
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Independent Database Schemes under Functional and Inclusion Dependencies
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Implementing Queries and Updates on Universal Scheme Interfaces
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Why is the snowflake schema a good data warehouse design?
Information Systems
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generating Compact Redundancy-Free XML Documents from Conceptual-Model Hypergraphs
IEEE Transactions on Knowledge and Data Engineering
Design non-recursive and redundant-free XML conceptual schema with hypergraph
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
| Hi-index | 0.00 |
The representative instance is proposed as a representation of the data stored in a database whose relations are not the projections of a universal instance. Database schemes are characterized for which local consistency implies global consistency. (Local consistency means that each relation satisfies its own functional dependencies; global consistency means that the representative instance satisfies all the functional dependencies.) A method of efficiently computing projections of the representative instance is given, provided that local consistency implies global consistency. Throughout, it is assumed that a cover of the functional dependencies is embodied in the database scheme in the form of keys.