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 (INRIA)
- 2. Joachim Niehren (INRIA)
- 3. Jean-Marc Talbot (University of Provence)
- 4. Sophie Tison (University of Lille 1)
BibTeX Citation
@inproceedings{filiot_pods07,
address = {New York, NY, USA},
series = {{PODS} '07},
title = {{Polynomial Time Fragments of XPath with Variables}},
url = {https://dl.acm.org/doi/10.1145/1265530.1265559},
doi = {10.1145/1265530.1265559},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Filiot, Emmanuel and Niehren, Joachim and Talbot, Jean-Marc and Tison, Sophie},
year = {2007}
}
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 |
|---|---|---|---|---|
| 1 | 12,534 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | VLDB |
| 2 | 9,249 | Decidable XPath Fragments in the Real World | 2019 | PODS |
| 3 | 1,564 | Conjunctive Queries over Trees | 2004 | PODS |
| 4 | 3,976 | Rewriting XPath Queries Using Materialized Views | 2005 | VLDB |
| 5 | 2,817 | On the minimization of XPath queries | 2003 | VLDB |
| 6 | 4,504 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS |
| 7 | 13,753 | XPath Evaluation in Linear Time | 2008 | PODS |
| 8 | 2,132 | The Complexity of XPath Query Evaluation | 2003 | PODS |
| 9 | 666 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB |
| 10 | 5,371 | XPath Evaluation in Linear Time with Polynomial Combined Complexity | 2009 | PODS |