XPath Satisfiability in the Presence of DTDs
Summary: Complexity map of XPath satisfiability under DTDs across practical fragments, isolating effects of upward axes, recursion, data-value joins and negation. Results: negation-free—PTIME/NP; with negation—PSPACE→EXPTIME; negation+data—NEXPTIME→undecidable; DTD-specific tractable cases. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Benedikt (AT&T)
- 2. Wenfei Fan (AT&T; University of Edinburgh)
- 3. Floris Geerts (University of Edinburgh; University of Limburg)
BibTeX Citation
@inproceedings{benedikt_pods05,
address = {New York, NY, USA},
series = {{PODS} '05},
title = {{XPath Satisfiability in the Presence of DTDs}},
url = {https://dl.acm.org/doi/10.1145/1065167.1065172},
doi = {10.1145/1065167.1065172},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Benedikt, Michael and Fan, Wenfei and Geerts, Floris},
year = {2005}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 395 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS | 0.00019298983 |
| 666 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00015166582 |
| 1,068 | Minimization of Tree Pattern Queries | 2001 | SIGMOD | 0.00012326498 |
| 1,372 | Typechecking for XML Transformers | 2000 | PODS | 0.00010994864 |
| 2,757 | Secure XML Querying with Security Views | 2004 | SIGMOD | 8.1601016e-05 |
| 2,969 | Expressive and efficient pattern languages for tree-structured data (extended abstract) | 2000 | PODS | 7.9147299e-05 |
| 3,274 | Frontiers of Tractability for Typechecking Simple XML Transformations | 2004 | PODS | 7.5749332e-05 |
| 3,917 | Tree Logical Classes for Efficient Evaluation of XQuery | 2004 | SIGMOD | 7.0182992e-05 |
| 4,537 | On Testing Satisfiability of Tree Pattern Queries | 2004 | VLDB | 6.6417534e-05 |
| 7,876 | Extended Path Expressions for XML | 2001 | PODS | 5.5249028e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,564 | Conjunctive Queries over Trees | 2004 | PODS |
| 2 | 395 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS |
| 3 | 2,864 | Typing and Querying XML Documents: Some Complexity Bounds | 2003 | PODS |
| 4 | 12,534 | Efficient Rewriting of XPath Queries Using Query Set Specifications | 2009 | 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 | 9,249 | Decidable XPath Fragments in the Real World | 2019 | PODS |
| 8 | 12,491 | Satisfiability of Downward XPath with Data Equality Tests | 2009 | PODS |
| 9 | 4,537 | On Testing Satisfiability of Tree Pattern Queries | 2004 | VLDB |
| 10 | 8,440 | On XPath with Transitive Axes and Data Tests | 2013 | PODS |