DBScholar

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
1417
Venue
PODS
Year
2007
Pagerank
5.093636e-05
Overall Rank
12,624 | 13.39%
DOI
10.1145/1265530.1265542

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{fan_pods07,
        address = {New York, NY, USA},
        series = {{PODS} '07},
        title = {{Expressiveness and Complexity of XML Publishing Transducers}},
        url = {https://dl.acm.org/doi/10.1145/1265530.1265542},
        doi = {10.1145/1265530.1265542},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fan, Wenfei and Geerts, Floris and Neven, Frank},
        year = {2007}
}

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