DBScholar

Back to papers

The Complexity of Text-Preserving XML Transformations

Summary: Defines text-preserving XML transforms whose output words are a subsequence of the input; characterizes them as copy- and reorder-free. Analyzes decision complexity: PTIME for top-down, EXPTIME-complete for DTL+XPath, decidable for DTL+MSO, and computes maximal input schemas. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1553
Venue
PODS
Year
2011
Pagerank
5.093636e-05
Overall Rank
12,365 | 15.17%
DOI
10.1145/1989284.1989316

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{antonopoulos_pods11,
        address = {New York, NY, USA},
        series = {{PODS} '11},
        title = {{The Complexity of Text-Preserving XML Transformations}},
        url = {https://dl.acm.org/doi/10.1145/1989284.1989316},
        doi = {10.1145/1989284.1989316},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Antonopoulos, Timos and Martens, Wim and Neven, Frank},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers