XPath satisfiability with downward and sibling axes is tractable under most of real-world DTDs.
Yasunori IshiharaKenji HashimotoShougo ShimizuToru FujiwaraPublished in: WIDM (2012)
Keyphrases
- sibling axes
- xpath queries
- regular expressions
- satisfiability problem
- query containment
- np complete
- pattern matching
- xml documents
- conjunctive queries
- xml data
- xml schema
- query rewriting
- transitive closure
- xml databases
- query answering
- complexity bounds
- decision procedures
- query evaluation
- query language
- query optimization
- cost model
- databases
- xpath expressions
- database
- constraint satisfaction
- special case
- data model
- deductive databases
- phase transition
- computational complexity
- tree automata
- constraint satisfaction problems