Core schema mappings

Scalable core computations in data exchange

Giansalvatore Mecca, Paolo Papotti, Salvatore Raunich

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)677-711
Number of pages35
JournalInformation Systems
Volume37
Issue number7
DOIs
Publication statusPublished - 1 Nov 2012
Externally publishedYes

Fingerprint

Electronic data interchange
Engines
Specifications
Processing

Keywords

  • Core computation
  • Data exchange
  • Schema mappings

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Core schema mappings : Scalable core computations in data exchange. / Mecca, Giansalvatore; Papotti, Paolo; Raunich, Salvatore.

In: Information Systems, Vol. 37, No. 7, 01.11.2012, p. 677-711.

Research output: Contribution to journalArticle

Mecca, Giansalvatore ; Papotti, Paolo ; Raunich, Salvatore. / Core schema mappings : Scalable core computations in data exchange. In: Information Systems. 2012 ; Vol. 37, No. 7. pp. 677-711.
@article{4bc6d25a98a5432f80a3465bd44a4c40,
title = "Core schema mappings: Scalable core computations in data exchange",
abstract = "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.",
keywords = "Core computation, Data exchange, Schema mappings",
author = "Giansalvatore Mecca and Paolo Papotti and Salvatore Raunich",
year = "2012",
month = "11",
day = "1",
doi = "10.1016/j.is.2012.03.004",
language = "English",
volume = "37",
pages = "677--711",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Core schema mappings

T2 - Scalable core computations in data exchange

AU - Mecca, Giansalvatore

AU - Papotti, Paolo

AU - Raunich, Salvatore

PY - 2012/11/1

Y1 - 2012/11/1

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

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

KW - Core computation

KW - Data exchange

KW - Schema mappings

UR - http://www.scopus.com/inward/record.url?scp=84861099559&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861099559&partnerID=8YFLogxK

U2 - 10.1016/j.is.2012.03.004

DO - 10.1016/j.is.2012.03.004

M3 - Article

VL - 37

SP - 677

EP - 711

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 7

ER -