Database Paper Browser

Back to papers

Expressiveness and Complexity of XML Publishing Transducers

Summary: Introduce publishing transducers: a machine model that generates XML trees via iterative relational queries, parameterized by query class, temporary storage, and optional virtual nodes, capturing existing XML-publishing languages. Characterize membership/emptiness/equivalence (PTIME→undecidable) and map expressiveness to PSPACE, linear-datalog fragments and logical tree transductions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1418
Venue
PODS
Year
2007
Pagerank
4.1945683e-05
Overall Rank
12,430 | 13.53%
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 8 of 8 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

Overall Rank Paper Year Venue Pagerank
2,150 Frontiers of Tractability for Typechecking Simple XML Transformations 2004 PODS 9.4255252e-05
8,190 XML Schema Mappings 2009 PODS 4.5641911e-05
12,440 Querying XML with Update Syntax 2007 SIGMOD 4.1945683e-05
1,848 Typing and Querying XML Documents: Some Complexity Bounds 2003 PODS 0.00010330772
5,296 Running Tree Automata on Probabilistic XML 2009 PODS 5.5802694e-05
12,215 Certain Answers for XML Queries 2010 PODS 4.1945683e-05
1,663 Conjunctive Queries over Trees 2004 PODS 0.00010977096
3,811 XML Type Checking with Macro Tree Transducers 2005 PODS 6.7380404e-05
12,169 The Complexity of Text-Preserving XML Transformations 2011 PODS 4.1945683e-05
13,753 On the Power of Walking for Querying Tree-Structured Data 2002 PODS -