Combined Complexity of Answering Tree-like Queries in OWL 2 QL.
Meghyn BienvenuStanislav KikotVladimir V. PodolskiiPublished in: Description Logics (2015)
Keyphrases
- combined complexity
- data complexity
- query answering
- ontology languages
- query language
- query evaluation
- query complexity
- answering queries
- conjunctive queries
- expressive power
- xml query languages
- data exchange
- integrity constraints
- transitive closure
- tree structure
- query processing
- lower complexity
- query rewriting
- data integration
- knowledge representation
- exptime complete
- data model
- regular path queries
- np complete
- dl lite
- database
- data management
- xml documents
- query containment
- incomplete information
- path expressions
- query interface
- complex objects
- r tree
- semantic web
- np hard
- search algorithm
- data structure
- databases