ACM Home Page
Please provide us with feedback. Feedback
Supporting executable mappings in model management
Full text PdfPdf (408 KB)
Source International Conference on Management of Data archive
Proceedings of the 2005 ACM SIGMOD international conference on Management of data table of contents
Baltimore, Maryland
SESSION: Research papers: data cleaning and mapping table of contents
Pages: 167 - 178  
Year of Publication: 2005
ISBN:1-59593-060-4
Authors
Sergey Melnik  Microsoft Research, Redmond, WA
Philip A. Bernstein  Microsoft Research, Redmond, WA
Alon Halevy  Univ. of Washington, Seattle, WA
Erhard Rahm  University of Leipzig, Germany
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): 8,   Downloads (12 Months): 96,   Citation Count: 21
Additional Information:

abstract   references   cited by   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/1066157.1066177
What is a DOI?

ABSTRACT

Model management is an approach to simplify the programming of metadata-intensive applications. It offers developers powerful operators, such as Compose, Diff, and Merge, that are applied to models, such as database schemas or interface specifications, and to mappings between models. Prior model management solutions focused on a simple class of mappings that do not have executable semantics. Yet many metadata applications require that mappings be executable, expressed in SQL, XSLT, or other data transformation languages.In this paper, we develop a semantics for model-management operators that allows applying the operators to executable mappings. Our semantics captures previously-proposed desiderata and is language-independent: the effect of the operators is expressed in terms of what they do to the instances of models and mappings. We describe an implemented prototype in which mappings are represented as dependencies between relational schemas, and discuss algebraic optimization of model-management scripts.


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
 
3
4
 
5
BEA, IBM, Microsoft, SAP, and Siebel. Business Process Execution Language for Web Services Version 1. 1, 2003.
 
6
P. A. Bernstein. Applying Model Management to Classical Metadata Problems. In Proc. CIDR, 2003.
7
 
8
P. A. Bernstein and E. Rahm. Data Warehouse Scenarios for Model Management. In Proc. ER, pages 1--15, Oct. 2000.
9
 
10
 
11
D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. View-based Query Processing: On the Relationship between Rewriting, Answering, and Losslessness. In Proc. ICDT, 2005.
12
 
13
 
14
 
15
16
 
17
18
19
20
 
21
 
22
J. Lin and A. O. Mendelzon. Merging Databases Under Constraints. Intl. Journal of Cooperative Information Systems, 7(1):55--76, 1998.
 
23
 
24
J. Madhavan and A. Halevy. Composing Mappings Among Data Sources. In Proc. VLDB, 2003.
 
25
S. Melnik. Generic Model Management: Concepts and Algorithms. Ph.D. thesis, University of Leipzig, Springer LNCS 2967, 2004.
 
26
S. Melnik, P. A. Bernstein, A. Halevy, and E. Rahm. A Semantics for Model Management Operators. Technical Report MSR-TR-2004-59, Microsoft Research, 2004.
27
28
 
29
L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernández, and R. Fagin. Translating Web Data. In Proc.VLDB, 2002.
 
30
R. Pottinger and P. A. Bernstein. Merging Models Based on Given Correspondences. In Proc. VLDB, 2003.
 
31
32
33
 
34
 
35
 
36
 
37
D. Srivastava and R. Ramakrishnan. Pushing Constraint Selections. Journal of Logic Programming. 16(3--4):361--414, 1993.
 
38
 
39
J. van Benthem and K. Doets. Higher-order logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Vol. 1. Reidel, Dordrecht, 1983.

CITED BY  21
Collaborative Colleagues:
Sergey Melnik: colleagues
Philip A. Bernstein: colleagues
Alon Halevy: colleagues
Erhard Rahm: colleagues