A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes.
Yasunori IshiharaTakuji MorimotoShougo ShimizuKenji HashimotoToru FujiwaraPublished in: DBPL (2009)
Keyphrases
- sibling axes
- np complete
- satisfiability problem
- regular expressions
- xpath queries
- query containment
- conjunctive queries
- np hard
- computational complexity
- pattern matching
- complexity bounds
- xml data
- constraint satisfaction problems
- xml documents
- decision procedures
- query answering
- query language
- xpath expressions
- phase transition
- xml databases
- transitive closure
- special case
- maximal tractable
- integrity constraints
- xml schema
- query rewriting
- data complexity
- database systems
- search algorithm