Three easy pieces on schema mappings for tree-structured data

Abstract : Schema mappings specify how data organized under a source schema should be reorganized under a target schema. For tree-structured data, the interplay between these specifications and the complex structural conditions imposed by the schemas, makes schema mappings a very rich formalism. Classical data management tasks, well-understood in the relational model, once again become challenging theoretical problems. Recent results on non-mixing integrity constraints help to push the decid-ability frontier further for three such problems: consistency of mappings, membership in the composition of mappings, and query answering.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01778169
Contributor : Admin Upem <>
Submitted on : Wednesday, April 25, 2018 - 2:38:19 PM
Last modification on : Tuesday, August 7, 2018 - 1:02:17 AM
Long-term archiving on : Tuesday, September 25, 2018 - 2:36:51 AM

File

DavidMurlak-AMW2017.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01778169, version 1

Collections

Citation

Claire David, Filip Murlak. Three easy pieces on schema mappings for tree-structured data. AMW 2017, Jun 2017, Montevideo, Uruguay. pp.1-10. ⟨hal-01778169⟩

Share

Metrics

Record views

65

Files downloads

12