ACM Home Page
Please provide us with feedback. Feedback
Core schema mappings
Full text PdfPdf (871 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Research session 17: data integration table of contents
Pages 655-668  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Giansalvatore Mecca  Universitàà della Basilicata, Potenza, Italy
Paolo Papotti  Università Roma Tre, Roma, Italy
Salvatore Raunich  Università della Basilicata, Potenza, Italy
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 55,   Downloads (12 Months): 232,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559845.1559914
What is a DOI?

ABSTRACT

Research has investigated mappings among data sources under two perspectives. On 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. However, despite the fact that the notion of a core of a data exchange solution has been formally identified as an optimal solution, there are yet no mapping systems that support core computations. 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Y. An, A. Borgida, R. Miller, and J. Mylopoulos. A Semantic Approach to Discovering Schema Mapping Expressions. In Proc. of ICDE, pages 206--215, 2007.
3
 
4
5
 
6
7
 
8
L. Chiticariu. Computing the Core in Data Exchange: Algorithmic Issues. MS Project Report, 2005. Unpublished manuscript.
 
9
10
11
 
12
13
 
14
 
15
16
 
17
 
18
 
19
 
20
 
21
B. ten Cate, L. Chiticariu, P. Kolaitis, and W. C. Tan. Laconic Schema Mappings: Computing Core Universal Solutions by Means of SQL Queries. Unpublished manuscript -http://arxiv.org/abs/0903.1953, March 2009.
22

Collaborative Colleagues:
Giansalvatore Mecca: colleagues
Paolo Papotti: colleagues
Salvatore Raunich: colleagues