2006/06/22 by Wim Martens, Martens, Wim, Frank Neven +3
Computer Science · #Advanced Data Storage Technologies #Advanced Database Systems and Queries #Databases (cs.DB) #FOS: Computer and information sciences #Programming Languages (cs.PL) #Semantic Web and Ontologies #cs.DB #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0606094
arxiv created 2006/06/22 · openalex publication_date 2006/06/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this general setting, both the input and output schema as well as the transformation are part of the input for the problem. However, scenarios where the input or output schema can be considered to be fixed, are quite common in practice. In the present work, we investigate the computational complexity of the typechecking problem in the latter setting.