The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.
Meghyn BienvenuStanislav KikotRoman KontchakovVladimir V. PodolskiiVladislav RyzhikovMichael ZakharyaschevPublished in: CoRR (2017)
Keyphrases
- bounded treewidth
- query language
- tractable cases
- ontology based data access
- conjunctive queries
- query rewriting
- np complete
- decision problems
- query answering
- query processing
- query evaluation
- ontology languages
- data model
- answering queries
- user queries
- response time
- fixed parameter tractable
- database
- expressive power
- complex queries
- relational learning
- semantic web
- range queries
- data objects
- integrity constraints
- boolean functions
- expert systems
- data complexity
- description logics
- lower bound
- knowledge representation
- knowledge base
- data mining