On the undecidability of the equivalence of second-order tuple generating dependencies

• We prove undecidability of logical equivalence of SO tuple generating dependencies.
• This result holds even for conjunctive query equivalent mappings.
• CQ-equivalence is shown undecidable for mappings based on SO tgds and source KDs.

Second-order tuple generating dependencies (SO tgds) were introduced by Fagin et al. to capture the composition of simple schema mappings. Testing the equivalence of SO tgds would be important for applications like model management and mapping optimization. However, we prove the undecidability of the logical equivalence of SO tgds. Moreover, under weak additional assumptions, we also show the undecidability of a relaxed notion of equivalence between two SO tgds, namely the so-called conjunctive query equivalence.