Please use this identifier to cite or link to this item:
Title: Frontiers of Tractability for Typechecking Simple XML Transformations.
Authors: MARTENS, Wim 
NEVEN, Frank 
Issue Date: 2004
Publisher: ACM
Source: Proceedings of the 23th ACM SIGMOD-SIGACT-SIGART. Symposium on Principles of Database Systems.
Abstract: Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output for documents satisfying a given input type. We focus on complete algorithms which always produce the correct answer. We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. By restricting schema languages and transformations, we identify several practical settings for which typechecking is in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios can not be enlarged without rendering the typechecking problem intactable. So, the present research sheds light on when to use fast complete algorithms and when to reside to sound but incomplete ones.
Document URI:
Link to publication:
ISBN: 158113858X
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
34 P-03.pdf268.08 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 15, 2022


checked on May 15, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.