Authors: Alejandra L. Paoletti, Flavio A. Ferrarotti, José M. Turull Torres
Tags: 2009, conceptual modeling
Roughly, we define a redundant relation in a database instance (dbi) as a k-ary relation R such that there is a first-order query which evaluated in the reduced dbi, gives us R. So, we can eliminate that relation R as long as the equivalence classes of the relation of equality of the first-order types for all k-tuples in the dbi are not altered. It turns out that in a fixed dbi, the problem of deciding whether a given relation in the dbi is redundant is decidable, though intractable. We then study redundant relations with a restricted notion of equivalence so that the problem becomes tractable.Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-642-04947-7_9
