The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.
Meghyn BienvenuStanislav KikotRoman KontchakovVladimir V. PodolskiiVladislav RyzhikovMichael ZakharyaschevPublished in: PODS (2017)
Keyphrases
- bounded treewidth
- query language
- conjunctive queries
- ontology based data access
- tractable cases
- query rewriting
- np complete
- query evaluation
- decision problems
- query answering
- data model
- query processing
- database
- relational learning
- expressive power
- answering queries
- computational complexity
- data sources
- query interface
- fixed parameter tractable
- databases
- range queries
- user queries
- knowledge representation
- domain knowledge
- knowledge base
- integrity constraints
- response time