Database Paper Browser

Back to papers

On Testing Satisfiability of Tree Pattern Queries

Summary: Systematic study of satisfiability for tree-pattern XPath queries, with/without schema; PTIME cases, NP-complete settings, and efficient algorithms. Experiments show satisfiability checking as cheap preprocessing, yielding query-evaluation savings. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9210
Venue
VLDB
Year
2004
Pagerank
6.034764e-05
Overall Rank
4,624 | 67.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,933 XPath Satisfiability in the Presence of DTDs 2005 PODS 0.00010049404
2,217 XML Data Exchange: Consistency and Query Answering 2005 PODS 9.2682054e-05
4,568 Rewriting XPath Queries Using Materialized Views 2005 VLDB 6.0725918e-05
9,531 Deciding Well-Definedness of XQuery Fragments 2005 PODS 4.3249319e-05
9,676 Schema-Based Query Optimisation for Graph Databases 2025 SIGMOD 4.3006524e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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