A technique for translating states between database schemata

Tomasz Imielinski, Witold Lipski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 1982 ACM SIGMOD International Conference on Management of Data, SIGMOD 1982
PublisherAssociation for Computing Machinery
Pages61-68
Number of pages8
ISBN (Print)0897910737
DOIs
StatePublished - Jun 2 1982
Externally publishedYes
Event1982 ACM SIGMOD International Conference on Management of Data, SIGMOD 1982 - Orlando, United States
Duration: Jun 2 1982Jun 4 1982

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078

Other

Other1982 ACM SIGMOD International Conference on Management of Data, SIGMOD 1982
CountryUnited States
CityOrlando
Period6/2/826/4/82

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems

Cite this