The complexity of ontology-based data access with OWL 2 QL and bounded treewidth queries
Our concern is the overhead of answeringOWL 2 QLontology-mediated queries (OMQs) inontology-based data access compared to evaluating their underlying tree-shaped and boundedtreewidth conjunctive queries (CQs). We show that OMQs withbounded-depth ontologieshave nonrecursive datalog (NDL) rewritings t...
| Κύριοι συγγραφείς: | , , , , , |
|---|---|
| Μορφή: | Conference or Workshop Item |
| Γλώσσα: | English |
| Έκδοση: |
2017
|
| Θέματα: | |
| Διαθέσιμο Online: | https://repository.londonmet.ac.uk/5788/1/1702.03358.pdf |