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

作者：

Highlights：

• 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.

摘要

Highlights•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.

论文关键词：Schema mapping optimization,Database dependencies,Data integration,Data exchange

论文评审过程：Received 20 April 2012, Revised 20 February 2014, Accepted 9 September 2014, Available online 18 September 2014.

论文官网地址：https://doi.org/10.1016/j.is.2014.09.003