Database Paper Browser

Back to papers

XML Transformation by Tree-Walking Transducers with Invisible Pebbles

Summary: Extend pebble tree automata/transducers with unbounded 'invisible' pebbles, enabling recognition of all regular tree languages and an XPath-like path algebra that captures every MSO-definable binary pattern. Show MSO tests on observable configs, model XSLT recursion, retain decidable typechecking, and often reduce typechecking complexity for conjunctive queries using MSO binary patterns. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1416
Venue
PODS
Year
2007
Pagerank
5.3561157e-05
Overall Rank
5,716 | 60.24%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,150 XPath, Transitive Closure Logic, and Nested Tree Walking Automata 2008 PODS 5.1846373e-05
12,382 Type Inference and Type Checking for Queries on Execution Traces 2008 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
713 Efficient Algorithms for Processing XPath Queries 2002 VLDB 0.00017731096
1,663 Conjunctive Queries over Trees 2004 PODS 0.00010977096
3,811 XML Type Checking with Macro Tree Transducers 2005 PODS 6.7380404e-05
3,851 The Expressivity of XPath with Transitive Closure* 2006 PODS 6.7057867e-05
Previous Page 1 / 1 Next

Semantically Similar Papers