Database Paper Browser

Back to papers

Efficient Algorithms for Minimizing Tree Pattern Queries

Summary: TPQ minimization for XML/LDAP graphs via graph simulation; three constraint settings: Case 1 no constraints O(n^2), Case 2 all constraints O(n^4), Case 3 required-child/descendant only O(n^2). Advances prior O(n^4)/O(n^6) bounds; runtime-optimal for Cases 1 and 3. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3358
Venue
SIGMOD
Year
2002
Pagerank
7.821865e-05
Overall Rank
2,956 | 79.44%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank Cited Paper Year Venue Pagerank
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
499 Containment and Equivalence for an XPath Fragment [Extended Abstract] 2002 PODS 0.000216753
810 Query Containment for Conjunctive Queries With Regular Expressions 1998 PODS 0.00016428374
882 DTD Inference for Views of XML Data 2000 PODS 0.00015657456
1,235 Minimization of Tree Pattern Queries 2001 SIGMOD 0.00013120483
1,490 On the Decidability of Query Containment under Constraints 1998 PODS 0.00011699154
1,662 Querying Network Directories 1999 SIGMOD 0.00010977682
3,960 Integrity Constraints for XML 2000 PODS 6.5882121e-05
Previous Page 1 / 1 Next

Semantically Similar Papers