A technique for translating states between database schemata

Authors:
Tomasz Imieliński;Witold Lipski, Jr.
Affiliations:
Institute of Computer Science, Polish Academy of Sciences, Poland;Institute of Computer Science, Polish Academy of Sciences, Poland
Venue:
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Year:
1982

Citing 7
Cited 4

The theory of joins in relational databases

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)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks

Communications of the ACM
Principles of Database Systems

Principles of Database Systems
A systematic approach to relational database theory

SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
A systematic approach to relational database theory

SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
On lossless tranformation of databases schemes not necessarily satisfying universal instance assumption

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inverting relational expressions: a uniform and natural technique for various database problems

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider two database schemata modeling the same reality. Given a state of the first schema, we can ask what information it provides about the state of the second schema. It turns out that this information can be represented by a table similar to a tableau of Aho, Sagiv and Ullman. We show a simple method to construct this table, by using results developed for tables of this type in the context of representing incomplete information in relational databases. We also consider a closely related notion of equivalence of database schemata, briefly sketching a method to test two schemata for equivalence.