Database Paper Browser

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
1554
Venue
PODS
Year
2011
Pagerank
4.1945683e-05
Overall Rank
12,169 | 15.35%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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