In the contexts of data integration and data exchange, schema mappings are primarily used for query answering. As a consequence, their maintenance and, in particular, the detection of corrupted mappings, i.e., mappings that fail in matching the source and/or the target schema, is crucial. Corruption checking can be automatically performed by relying on an operation called type projection. This work describes an efficient algorithm for checking XML type projection, based on a characterization of type projection in terms of type simulation.
An Efficient Algorithm for XML Type Projection
SARTIANI, CARLO
2006-01-01
Abstract
In the contexts of data integration and data exchange, schema mappings are primarily used for query answering. As a consequence, their maintenance and, in particular, the detection of corrupted mappings, i.e., mappings that fail in matching the source and/or the target schema, is crucial. Corruption checking can be automatically performed by relying on an operation called type projection. This work describes an efficient algorithm for checking XML type projection, based on a characterization of type projection in terms of type simulation.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
ppdp38-colazzo.pdf
solo utenti autorizzati
Tipologia:
Documento in Post-print
Licenza:
DRM non definito
Dimensione
228.87 kB
Formato
Adobe PDF
|
228.87 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.