On the minimization of Xpath queries
Summary: Extends XPath minimization to a general fragment including wildcard and shows NP-hardness of minimizing XPath queries. Proposes an algorithm to compute minimum XPath expressions and identifies a tractable case with a polynomial-time solution. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. S. Flesca
- 2. F. Furfaro
- 3. E. Masciari
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,479 | Efficient Query Reformulation in Peer Data Management Systems | 2004 | SIGMOD | 8.6909119e-05 |
| 2,704 | FleXPath: Flexible Structure and Full-Text Querying for XML | 2004 | SIGMOD | 8.2720556e-05 |
| 4,568 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB | 6.0784118e-05 |
| 5,611 | Query Caching and View Selection for XML Databases | 2005 | VLDB | 5.4113701e-05 |
| 5,948 | Minimization of Tree Pattern Queries with Constraints | 2008 | SIGMOD | 5.2602218e-05 |
| 6,300 | Rewriting Nested XML Queries Using Nested Views | 2006 | SIGMOD | 5.1223169e-05 |
| 6,681 | Query Efficiency in Probabilistic XML Models | 2008 | SIGMOD | 4.9643102e-05 |
| 9,534 | Answering Tree Pattern Queries Using Views | 2006 | VLDB | 4.3268303e-05 |
| 11,827 | Minimization of Tree Pattern Queries | 2016 | PODS | 4.1945683e-05 |
| 12,606 | The NEXT Framework for Logical XQuery Optimization | 2004 | VLDB | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 407 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024004562 |
| 499 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS | 0.000216753 |
| 713 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017731096 |
| 810 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00016428374 |
| 1,235 | Minimization of Tree Pattern Queries | 2001 | SIGMOD | 0.00013120483 |
| 1,952 | Deciding Containment for Queries with Complex Objects (Extended Abstract) | 1997 | PODS | 9.9677831e-05 |
| 2,956 | Efficient Algorithms for Minimizing Tree Pattern Queries | 2002 | SIGMOD | 7.821865e-05 |
| 4,048 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4968603e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,695 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8345021e-05 |
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 4,625 | On Testing Satisfiability of Tree Pattern Queries | 2004 | VLDB | 6.0406081e-05 |
| 1,929 | XPath Satisfiability in the Presence of DTDs | 2005 | PODS | 0.00010058897 |
| 12,281 | XPath Whole Query Optimization | 2010 | VLDB | 4.1945683e-05 |
| 2,248 | The Complexity of XPath Query Evaluation | 2003 | PODS | 9.2038466e-05 |
| 713 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017731096 |
| 12,340 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | VLDB | 4.1945683e-05 |
| 4,568 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB | 6.0784118e-05 |
| 12,605 | Taming XPath Queries by Minimizing Wildcard Steps | 2004 | VLDB | 4.1945683e-05 |