Laconic schema mappings: computing core universal solutions by means of SQL queries
| dc.creator | Cate, Balder ten | |
| dc.creator | Chiticariu, Laura | |
| dc.creator | Kolaitis, Phokion | |
| dc.creator | Tan, Wang-Chiew | |
| dc.date | 2009-03-11 | |
| dc.date.accessioned | 2026-07-07T12:51:36Z | |
| dc.date.available | 2026-07-07T12:51:36Z | |
| dc.description | We present a new method for computing core universal solutions in data exchange settings specified by source-to-target dependencies, by means of SQL queries. Unlike previously known algorithms, which are recursive in nature, our method can be implemented directly on top of any DBMS. Our method is based on the new notion of a laconic schema mapping. A laconic schema mapping is a schema mapping for which the canonical universal solution is the core universal solution. We give a procedure by which every schema mapping specified by FO s-t tgds can be turned into a laconic schema mapping specified by FO s-t tgds that may refer to a linear order on the domain of the source instance. We show that our results are optimal, in the sense that the linear order is necessary and the method cannot be extended to schema mapping involving target constraints. | |
| dc.identifier | https://arxiv.org/abs/0903.1953 | |
| dc.identifier | http://arxiv.org/abs/0903.1953 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/223041 | |
| dc.subject | Databases | |
| dc.title | Laconic schema mappings: computing core universal solutions by means of SQL queries | |
| dc.type | text |