ACM Home Page
Please provide us with feedback. Feedback
Frontiers of tractability for typechecking simple XML transformations
Full text PdfPdf (229 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Paris, France
SESSION: XML processing table of contents
Pages: 23 - 34  
Year of Publication: 2004
ISBN:158113858X
Authors
Wim Martens  Universitaire Campus, Belgium
Frank Neven  Universitaire Campus, Belgium
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Citation Count: 18
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1055558.1055563
What is a DOI?

ABSTRACT

Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type 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 intractable. So, the present research sheds light on when to use fast complete algorithms and when to reside to sound but incomplete ones.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
 
5
 
6
J. Clark and S. DeRose. XML Path Language (XPath). http://www.w3.org/TR/xpath.
 
7
8
 
9
 
10
11
 
12
J. Engelfriet and S. Maneth. A comparison of pebble tree transducers with macro tree transducers. Acta Information, 39:613--698, 2003.
 
13
D. Lee, M. Mani, and M. Murata. Reasoning about XML schema languages using formal language theory. Technical report, IBM Almaden Research Center, 2000. Log# 95071.
 
14
 
15
W. Martens and F. Neven. Frontiers of tractability for typechecking simple XML transformations: Full version. http://alpha.luc.ac.be/~lucp1436/pubs.html.
 
16
 
17
W. Martens, F. Neven, and T. Schwentick. Complexity of Simple Regular Expressions with Applications to XML Schema Languages. Submitted.
18
 
19
20
 
21
22
 
23
 
24
25
26
 
27
 
28
World Wide Web Consortium. XML Schema. http://www.w3.org/XML/Schema.

CITED BY  18
Collaborative Colleagues:
Wim Martens: colleagues
Frank Neven: colleagues