Database Paper Browser

Back to papers

The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries

Summary: Nonrecursive-datalog rewritings for OWL 2 QL OMQs yield combined complexity LOGCFL (and NL for tree-shaped CQs with bounded leaves), so bounded-depth ontologies or bounded-treewidth/tree-shaped bounded-leaf CQs cause no complexity overhead. Negative results: answering OMQs is not FPT when parameterized by ontology depth or leaf-count; with a fixed infinite-depth ontology it is NP-complete for tree-shaped CQs and LOGCFL-complete for bounded-leaf CQs; rewritings are experimentally scalable. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1709
Venue
PODS
Year
2017
Pagerank
4.1945683e-05
Overall Rank
11,761 | 18.19%
DOI
10.1145/3034786.3034791

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
3,117 Processing Queries on Tree-Structured Data Efficiently 2006 PODS 7.5407318e-05
3,909 Chase Termination for Guarded Existential Rules 2015 PODS 6.6375375e-05
6,601 Teaching an RDBMS about ontological constraints 2016 VLDB 4.9972581e-05
Previous Page 1 / 1 Next

Semantically Similar Papers