Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/13105
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | ANTONOPOULOS, Timos | - |
dc.contributor.author | MARTENS, Wim | - |
dc.contributor.author | NEVEN, Frank | - |
dc.date.accessioned | 2012-02-03T13:37:45Z | - |
dc.date.available | 2012-02-03T13:37:45Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | Lenzerini, Maurizio; Schwentick, Thomas (Ed.). Proceedings of the 30th Symposium on Principles of Database Systems, ACM Press,p. 247-258 | - |
dc.identifier.isbn | 978-1-4503-0660-7 | - |
dc.identifier.uri | http://hdl.handle.net/1942/13105 | - |
dc.description.abstract | While XML is nowadays adopted as the de facto standard for data exchange, historically, its predecessor SGML was invented for describing electronic documents, i.e., marked up text. Actually, today there are still large volumes of such XML texts. We consider simple transformations which can change the internal structure of documents, that is, the mark-up, and can filter out parts of the text but do not disrupt the ordering of the words. Specifically, we focus on XML transformations where the transformed document is a subsequence of the input document when ignoring mark-up. We call the latter text-preserving XML transformations. We characterize such transformations as copy- and rearrange-free transductions. Furthermore, we study the problem of deciding whether a given XML transducer is text-preserving over a given tree language. We consider top-down transducers as well as the abstraction of XSLT called DTL. We show that deciding whether a transformation is text-preserving over an unranked regular tree language is in PTime for top-down transducers, EXPTime-complete for DTL with XPath, and decidable for DTL with MSO patterns. Finally, we obtain that for every transducer in one of the above mentioned classes, the maximal subset of the input schema can be computed on which the transformation is text-preserving. | - |
dc.language.iso | en | - |
dc.publisher | ACM Press | - |
dc.subject.other | Algorithms; theory; verification | - |
dc.title | The complexity of text-preserving XML transformations | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Lenzerini, Maurizio | - |
local.bibliographicCitation.authors | Schwentick, Thomas | - |
local.bibliographicCitation.conferencedate | 12-16 June, 2011 | - |
local.bibliographicCitation.conferencename | ACM Symposium on Principles of Database Systems | - |
local.bibliographicCitation.conferenceplace | Athens, Greece | - |
dc.identifier.epage | 258 | - |
dc.identifier.spage | 247 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.doi | 10.1145/1989284.1989316 | - |
local.bibliographicCitation.btitle | Proceedings of the 30th Symposium on Principles of Database Systems | - |
item.fulltext | With Fulltext | - |
item.accessRights | Restricted Access | - |
item.fullcitation | ANTONOPOULOS, Timos; MARTENS, Wim & NEVEN, Frank (2011) The complexity of text-preserving XML transformations. In: Lenzerini, Maurizio; Schwentick, Thomas (Ed.). Proceedings of the 30th Symposium on Principles of Database Systems, ACM Press,p. 247-258. | - |
item.contributor | ANTONOPOULOS, Timos | - |
item.contributor | MARTENS, Wim | - |
item.contributor | NEVEN, Frank | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
p247-antonopoulos.pdf Restricted Access | Published version | 719.61 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
2
checked on Sep 2, 2020
Page view(s)
78
checked on Sep 5, 2022
Download(s)
60
checked on Sep 5, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.