Conjunctive Query Equivalence of Keyed Relational Schemas
Joseph Albert
Yannis Ioannidis
Raghu Ramakrishnan
Date published: 
Published In: 
16th Int’l ACM PODS Symposium, Tucson, AZ, May 1997
Conference Article

The notion of when two schemas are equivalent is fundamental to database design, schema integration, and data model translation. An important notion of schema equivalence, query equivalence was introduced in [3], and used to evaluate the correctness of schema transformations. The logically equivalent notion of calculous equivalence, as well as three progressively weaker notions of schema equivalence were introduced in 1984 by Hull [9, 10], who showed that two schemas with no dependencies are equivalent (under all four notions of equivalence) if and only if they are identical (up to renaming and re-ordering of attributes and relations). Hull also conjectured that the same result holds for schemas with primary keys. In this work, we resolve the conjecture in the affirmative for the case of query equivalence based on mappings using conjunctive relational queries with equality selections.

Related files: 

MaDgIK 2009-2016