Database Paper Browser

Back to papers

Minimization of Tree Pattern Queries

Summary: Proves minimization of tree-pattern queries (child/descendant, labels, wildcards) is Sigma^P_2-complete, resolving an open problem of Flesca et al. (2003). Disproves the M-NR conjecture by showing minimality cannot be achieved by node deletion and gives a gadget reduction. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1690
Venue
PODS
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,827 | 17.73%
DOI
10.1145/2902251.2902295

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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