On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas

Details On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas

2006-06-22

arxiv.org/abs/cs/0606094v1

Computer Science

Databases

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208409