DBScholar

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
3420
Venue
SIGMOD
Year
2002
Pagerank
8.267202e-05
Overall Rank
2,680 | 81.62%
DOI
10.1145/564691.564726

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ramanan_sigmod02,
        title = {{Efficient Algorithms for Minimizing Tree Pattern Queries}},
        author = {Ramanan, Prakash},
        series = {{SIGMOD} '02},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/564691.564726},
        url = {https://dl.acm.org/doi/10.1145/564691.564726},
        year = {2002}
}

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
40 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00046918506
395 Containment and Equivalence for an XPath Fragment [Extended Abstract] 2002 PODS 0.00019298983
686 Query Containment for Conjunctive Queries With Regular Expressions 1998 PODS 0.00014948634
1,068 Minimization of Tree Pattern Queries 2001 SIGMOD 0.00012326498
1,290 DTD Inference for Views of XML Data 2000 PODS 0.00011312135
1,630 On the Decidability of Query Containment under Constraints 1998 PODS 0.00010180625
2,201 Querying Network Directories 1999 SIGMOD 8.9653966e-05
4,167 Integrity Constraints for XML 2000 PODS 6.8578387e-05
Previous Page 1 / 1 Next

Semantically Similar Papers