5 citations · 9 across the 12 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DB2024
Soft and Constrained Hypertree Width
Matthias Lanzinger, Cem Okulmus, Reinhard Pichler +2
Hypertree decompositions provide a way to evaluate Conjunctive Queries (CQs) in polynomial time, where the exponent of this polynomial is determined by the width of the decompositi…
cs.DB2024★ 1 cited
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus +1
Despite the many advantages that ontology-based data access (OBDA) has brought to a range of application domains, state-of-the-art OBDA systems still do not support popular graph d…