On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Wim Martens, Frank Neven, Marc Gyssens
Abstract
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.
Create a lesson
Related papers
Compositional Online Learning for Semantic Data Processing Systems
Paweł Liskowski, Fuheng Zhao, Benjamin Han et al.
Incremental Delta-Shapley: A Standalone Runtime for Predicate Attribution on Sliding Windows
Pouya Khani, Ira Assent
Size Bounds for CQs Under Acyclic Constraints
Stefan Mengel, Andrei Romashchenko
IBLTs Measure Before They Decode: Self-Sizing Set Reconciliation from Pre-Peeling Counts
Min Wu, Ji Qi, Chengdui Luo et al.
VoS: Variate Ordering Strategies for Skyline Query Optimization
Abhinav Gorantla, Pratanu Mandal, K. Selçuk Candan et al.
Realistic Counterfactual Explanations via Denial Constraints
Avia Asael, Nave Frost, Amir Gilad et al.