DBScholar

Back to papers

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)

Paper ID
1337
Venue
PODS
Year
2005
Pagerank
9.4878711e-05
Overall Rank
1,916 | 86.86%
DOI
10.1145/1065167.1065172

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers