Polynomial Time Fragments of XPath with Variables
Summary: Identifies a fragment of Core XPath 2.0 with variables that remains n-ary FO-complete (captures first-order queries modulo linear-time transformations). Proves this fragment admits polynomial-time query evaluation, isolating tractable XPath-with-variables cases. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Emmanuel Filiot
- 2. Joachim Niehren
- 3. Jean-Marc Talbot
- 4. Sophie Tison
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 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,105 | Decidable XPath Fragments in the Real World | 2019 | PODS | 4.3953995e-05 |
| 12,340 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | VLDB | 4.1945683e-05 |
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 4,568 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB | 6.0784118e-05 |
| 3,084 | On the minimization of Xpath queries | 2003 | VLDB | 7.6011919e-05 |
| 4,366 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS | 6.2538592e-05 |
| 13,553 | XPath Evaluation in Linear Time | 2008 | PODS | - |
| 2,248 | The Complexity of XPath Query Evaluation | 2003 | PODS | 9.2038466e-05 |
| 713 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017731096 |
| 4,663 | XPath Evaluation in Linear Time with Polynomial Combined Complexity | 2009 | PODS | 6.0128493e-05 |