| dc.contributor.author | Wisnesky, Ryan | |
| dc.date.accessioned | 2016-01-21T20:52:57Z | |
| dc.date.issued | 2009 | |
| dc.identifier.citation | Wisnesky, Ryan. 2009. Mapping Dependence. Harvard Computer Science Group Technical Report TR-09-09. | en_US |
| dc.identifier.uri | http://nrs.harvard.edu/urn-3:HUL.InstRepos:24829607 | |
| dc.description.abstract | We describe DMSL, a domain specific language for defining schema mappings. Schema mappings are assertions in carefully crafted logics that express constraints between data represented in different formats, including XML and relational schema. DMSL is suitable for representing programs over mappings, which, for instance, occur in dataflow graphs of mappings. DMSL programs of mapping type are statically guaranteed by a qualified type system to denote satisfiable constraints; the principal polymorphic schemas of source and target solution data instances are automatically inferred. DMSL implements a variety of operations over mappings (e.g., composition) by interfacing with IBM’s Clio Mapping Engine. | en_US |
| dc.description.sponsorship | Engineering and Applied Sciences | en_US |
| dc.language.iso | en_US | en_US |
| dash.license | LAA | |
| dc.title | Mapping Dependence | en_US |
| dc.type | Research Paper or Report | en_US |
| dc.description.version | Version of Record | en_US |
| dash.depositing.author | Wisnesky, Ryan | |
| dc.date.available | 2016-01-21T20:52:57Z | |
| dash.contributor.affiliated | Wisnesky, Ryan | |
