Database Paper Browser

Back to papers

Conjunctive Queries over Trees

Summary: Charts the tractability frontier for conjunctive queries on unranked labeled trees with XPath-like axes, providing a framework and listing all maximal axis-sets that admit polynomial-time evaluation. Shows every CQ is equivalent to a union of acyclic CQs, but conversion can incur superpolynomial blowup. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1321
Venue
PODS
Year
2004
Pagerank
0.00010977096
Overall Rank
1,663 | 88.44%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers