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)
Incoming Non-self Citations Over Time
Authors
- 1. Georg Gottlob (Vienna University of Technology)
- 2. Christoph Koch (Vienna University of Technology)
- 3. Klaus U. Schulz (Ludwig Maximilian University of Munich)
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 666 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00015166582 |
| 1,317 | MARS: A System for Publishing XML from Mixed and Redundant Storage | 2003 | VLDB | 0.00011179293 |
| 2,180 | Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | 2002 | PODS | 9.0110009e-05 |
| 2,564 | Visual Web Information Extraction with Lixto | 2001 | VLDB | 8.4118854e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,864 | Typing and Querying XML Documents: Some Complexity Bounds | 2003 | PODS |
| 2 | 3,167 | From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery | 2003 | VLDB |
| 3 | 8,440 | On XPath with Transitive Axes and Data Tests | 2013 | PODS |
| 4 | 13,954 | On the Power of Walking for Querying Tree-Structured Data | 2002 | PODS |
| 5 | 2,625 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB |
| 6 | 6,442 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS |
| 7 | 2,817 | On the minimization of XPath queries | 2003 | VLDB |
| 8 | 4,537 | On Testing Satisfiability of Tree Pattern Queries | 2004 | VLDB |
| 9 | 12,534 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | VLDB |
| 10 | 4,107 | Processing Queries on Tree-Structured Data Efficiently | 2006 | PODS |