DBScholar

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
1320
Venue
PODS
Year
2004
Pagerank
0.00010349456
Overall Rank
1,564 | 89.28%
DOI
10.1145/1055558.1055585

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gottlob_pods04,
        address = {New York, NY, USA},
        series = {{PODS} '04},
        title = {{Conjunctive Queries over Trees}},
        url = {https://dl.acm.org/doi/10.1145/1055558.1055585},
        doi = {10.1145/1055558.1055585},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gottlob, Georg and Koch, Christoph and Schulz, Klaus U.},
        year = {2004}
}

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