Database Paper Browser

Back to papers

The (Almost) Complete Guide to Tree Pattern Containment

Summary: Comprehensive reclassification of tree-pattern query containment/validity/satisfiability with and without schema, unifying prior results and resolving long-open complexity gaps via novel automata/reduction techniques. Pinpoints exact tractability and hardness boundaries for patterns on trees (and graphs). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1651
Venue
PODS
Year
2015
Pagerank
4.2617199e-05
Overall Rank
9,890 | 31.20%
DOI
10.1145/2745754.2745766

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
9,676 Schema-Based Query Optimisation for Graph Databases 2025 SIGMOD 4.3047774e-05
11,827 Minimization of Tree Pattern Queries 2016 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
499 Containment and Equivalence for an XPath Fragment [Extended Abstract] 2002 PODS 0.000216753
1,037 Querying Graph Databases 2013 PODS 0.00014502493
1,663 Conjunctive Queries over Trees 2004 PODS 0.00010977096
4,366 The Complexity of Query Containment in Expressive Fragments of XPath 2.0 2007 PODS 6.2538592e-05
7,584 Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data 2012 VLDB 4.7041255e-05
8,255 Discovering XSD Keys from XML Data 2013 SIGMOD 4.5491362e-05
Previous Page 1 / 1 Next

Semantically Similar Papers