DBScholar

Back to papers

Satisfiability of Downward XPath with Data Equality Tests

Summary: Proves satisfiability of downward XPath with data equality/inequality (descendant*, child, =) is decidable and ExpTime-complete, even with Kleene-star and without DTDs or the sibling axis. Introduces a novel data-tree automaton with ExpTime emptiness and pins exact complexities of several downward fragments. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1491
Venue
PODS
Year
2009
Pagerank
5.093636e-05
Overall Rank
12,491 | 14.31%
DOI
10.1145/1559795.1559827

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{figueira_pods09,
        address = {New York, NY, USA},
        series = {{PODS} '09},
        title = {{Satisfiability of Downward XPath with Data Equality Tests}},
        url = {https://dl.acm.org/doi/10.1145/1559795.1559827},
        doi = {10.1145/1559795.1559827},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Figueira, Diego},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,440 On XPath with Transitive Axes and Data Tests 2013 PODS 5.4248063e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
3,711 The Expressivity of XPath with Transitive Closure* 2006 PODS 7.1778094e-05
4,071 Two-Variable Logic on Data Trees and XML Reasoning 2006 PODS 6.927159e-05
6,442 XPath, Transitive Closure Logic, and Nested Tree Walking Automata 2008 PODS 5.8776391e-05
Previous Page 1 / 1 Next

Semantically Similar Papers