An efficient algorithm for XML type projection

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationPPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
PublisherAssociation for Computing Machinery (ACM)
Pages51-60
Number of pages10
ISBN (Print)1595933883, 9781595933881
DOIs
Publication statusPublished - 1 Jan 2006
Externally publishedYes
EventPPDP'06 - 8th ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming - Venice, Italy
Duration: 10 Jul 200612 Jul 2006

Publication series

NamePPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Volume2006

Conference

ConferencePPDP'06 - 8th ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Country/TerritoryItaly
CityVenice
Period10/07/0612/07/06

Keywords

  • Languages

Fingerprint

Dive into the research topics of 'An efficient algorithm for XML type projection'. Together they form a unique fingerprint.

Cite this