Scalable data exchange with functional dependencies

Bruno Marnette, Giansalvatore Mecca, Paolo Papotti

Research output: Contribution to journalArticle

31 Scopus citations

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 languageEnglish (US)
Pages (from-to)105-116
Number of pages12
JournalProceedings of the VLDB Endowment
Volume3
Issue number1
DOIs
StatePublished - Sep 2010

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Scalable data exchange with functional dependencies'. Together they form a unique fingerprint.

  • Cite this