### Abstract

The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have been developed to generate optimal solutions for mapping scenarios in a highly scalable way, by relying on SQL. However, these algorithms suffer from a serious drawback: they are not able to handle key constraints and functional dependencies on the target, i.e., equality generating dependencies (egds). While egds play a crucial role in the generation of optimal solutions, handling them with first-order languages is a difficult problem. In fact, we start from a negative result: it is not always possible to compute solutions for scenarios with egds using an SQL script. Then, we identify many practical cases in which this is possible, and develop a best-effort algorithm to do this. Experimental results show that our algorithm produces solutions of better quality with respect to those produced by previous algorithms, and scales nicely to large databases.

Original language | English |
---|---|

Title of host publication | Proceedings of the VLDB Endowment |

Pages | 105-116 |

Number of pages | 12 |

Volume | 3 |

Edition | 1 |

Publication status | Published - Sep 2010 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science (miscellaneous)
- Computer Science(all)

### Cite this

*Proceedings of the VLDB Endowment*(1 ed., Vol. 3, pp. 105-116)