A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Equivalence of Keyed Relational Schemas by Conjunctive Queries
1999
Journal of computer and system sciences (Print)
The concept of two schemas being equivalent is fundamental to database design, schema integration, and data model translation. An important notion of schema equivalence, query equivalence, was introduced by Atzeni et al., and used to evaluate the correctness of schema transformations. The logically equivalent notion of calculous equivalence, as well as three progressively more general notions of schema equivalence were introduced in 1984 by Hull, who showed that two schemas with no dependencies
doi:10.1006/jcss.1999.1628
fatcat:2wrpbubckzfzfmlaj5sygcyb7e