Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/611
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | MARTENS, Wim | - |
dc.contributor.author | NEVEN, Frank | - |
dc.date.accessioned | 2005-03-08T14:27:53Z | - |
dc.date.available | 2005-03-08T14:27:53Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 64-78 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/611 | - |
dc.description.abstract | We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema. As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. We focus on simple top-down recursive transformations motivated by XSLT and structural recursion on trees. We parameterize the problem by several restrictions on the transformations (deleting, non-deleting, bounded width) and consider both tree automata and DTDs as output schemas. The complexity of the typechecking problems in this scenario range from ptime to exptime. | - |
dc.format.extent | 180689 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.title | Typechecking Top-Down Uniform Unranked Tree Transducers. | - |
dc.type | Journal Contribution | - |
local.bibliographicCitation.conferencename | DATABASE THEORY ICDT 2003, PROCEEDINGS | - |
dc.identifier.epage | 78 | - |
dc.identifier.spage | 64 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.relation.ispartofseriesnr | 2572 | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1007/3-540-36285-1_5 | - |
dc.identifier.isi | 000181548600005 | - |
item.contributor | MARTENS, Wim | - |
item.contributor | NEVEN, Frank | - |
item.validation | ecoom 2004 | - |
item.fulltext | With Fulltext | - |
item.accessRights | Open Access | - |
item.fullcitation | MARTENS, Wim & NEVEN, Frank (2003) Typechecking Top-Down Uniform Unranked Tree Transducers.. In: DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 64-78. | - |
crisitem.journal.issn | 0302-9743 | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
35
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
31
checked on Oct 14, 2024
Page view(s)
254
checked on Nov 1, 2023
Download(s)
392
checked on Nov 1, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.