Core schema mappings: Scalable core computations in data exchange

详细信息	查看全文 | 推荐本文 |

• 作者：Giansalvatore Mecca^a ; ^{giansalvatore.mecca@gmail.com} ; ^{giansalvatore.mecca@unibas.it} ; Paolo Papotti^b ; Salvatore Raunich^c
• 关键词：Schema mappings ; Data exchange ; Core computation
• 刊名：Information Systems
• 出版年：2012
• 期刊代码：64_03064379
• 类别：cp
• 出版时间：November, 2012
• 卷：37
• 期：7
• 页码：677-711
• 文件大小：983 K

摘要

Research has investigated mappings among data sources under two perspectives. On the one side, there are studies of practical tools for schema mapping generation; these focus on algorithms to generate mappings based on visual specifications provided by users. On the other side, we have theoretical researches about data exchange. These study how to generate a solution - i.e., a target instance - given a set of mappings usually specified as tuple generating dependencies. Since the notion of a core solution has been formally identified as an optimal solution, it is very important to efficiently support core computations in mapping systems. In this paper, we introduce several new algorithms that contribute to bridge the gap between the practice of mapping generation and the theory of data exchange. We show how, given a mapping scenario, it is possible to generate an executable script that computes core solutions for the corresponding data exchange problem. The algorithms have been implemented and tested using common runtime engines to show that they guarantee very good performances, orders of magnitudes better than those of known algorithms that compute the core as a post-processing step.