A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Joined normal form: a storage encoding for relational databasess
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Normal forms and relational database operators
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
Toward logical data independence: a relational query language without relations
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On equivalences of database schemes
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A universal relation database system implemented via the network model
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Notions of dependency satisfaction
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A formal treatment of imperfect information in database management
A formal treatment of imperfect information in database management
Notions of dependency satisfaction
Journal of the ACM (JACM) - The MIT Press scientific computation series
On the properties and characterization of connection-trap-free schemes
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
A new basis for the weak instance model
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
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
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
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)
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Implementing Queries and Updates on Universal Scheme Interfaces
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Partial answers in information integration systems
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
Towards an algebraic theory of information integration
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Towards an algebraic theory of information integration
Information and Computation
| Hi-index | 0.00 |
Recent work considers a database state to satisfy a set of dependencies if there exists a satisfying universal relation whose projections contain each of the relations in the state. Such relations are called weak instances for the state. We propose the set of all weak instances for a state as an embodiment of the information represented by the state. We characterize states that have the same set of weak instances by the equivalence of their associated tableaux. We apply this notion to the comparison of database schemes and characterize all pairs of schemes such that for every legal state of one of them there exists an equivalent legal state of the other one. We use this approach to provide a new characterization of Boyce-Codd Normal Form relation schemes.