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,480 | Efficient Query Reformulation in Peer Data Management Systems | 2004 | SIGMOD | 8.682497e-05 |
| 2,707 | FleXPath: Flexible Structure and Full-Text Querying for XML | 2004 | SIGMOD | 8.265158e-05 |
| 4,568 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB | 6.0725918e-05 |
| 5,621 | Query Caching and View Selection for XML Databases | 2005 | VLDB | 5.4061733e-05 |
| 5,950 | Minimization of Tree Pattern Queries with Constraints | 2008 | SIGMOD | 5.2551296e-05 |
| 6,300 | Rewriting Nested XML Queries Using Nested Views | 2006 | SIGMOD | 5.1174095e-05 |
| 6,682 | Query Efficiency in Probabilistic XML Models | 2008 | SIGMOD | 4.9596732e-05 |
| 9,535 | Answering Tree Pattern Queries Using Views | 2006 | VLDB | 4.3226836e-05 |
| 11,835 | Minimization of Tree Pattern Queries | 2016 | PODS | 4.1905499e-05 |
| 12,615 | The NEXT Framework for Logical XQuery Optimization | 2004 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 499 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS | 0.00021654356 |
| 712 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017714027 |
| 808 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.000164132 |
| 1,236 | Minimization of Tree Pattern Queries | 2001 | SIGMOD | 0.00013107769 |
| 1,959 | Deciding Containment for Queries with Complex Objects (Extended Abstract) | 1997 | PODS | 9.958725e-05 |
| 2,957 | Efficient Algorithms for Minimizing Tree Pattern Queries | 2002 | SIGMOD | 7.8143379e-05 |
| 4,055 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4906839e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,697 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8281158e-05 |
| 1,662 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010966423 |
| 4,624 | On Testing Satisfiability of Tree Pattern Queries | 2004 | VLDB | 6.034764e-05 |
| 1,933 | XPath Satisfiability in the Presence of DTDs | 2005 | PODS | 0.00010049404 |
| 12,289 | XPath Whole Query Optimization | 2010 | VLDB | 4.1905499e-05 |
| 2,250 | The Complexity of XPath Query Evaluation | 2003 | PODS | 9.1949563e-05 |
| 712 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017714027 |
| 12,348 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | VLDB | 4.1905499e-05 |
| 4,568 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB | 6.0725918e-05 |
| 12,614 | Taming XPath Queries by Minimizing Wildcard Steps | 2004 | VLDB | 4.1905499e-05 |