Query Definability and Its Approximations in Ontology-based Data Management - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Query Definability and Its Approximations in Ontology-based Data Management

(1) , (2) , (2)
1
2

Abstract

Given an input dataset (i.e., a set of tuples), query definability in Ontology-based Data Management (OBDM) amounts to finding a query over the ontology whose certain answers coincide with the tuples in the given dataset. We refer to such a query as a characterization of the dataset with respect to the OBDM system. Our first contribution is to propose approximations of perfect characterizations in terms of recall (complete characterizations) and precision (sound characterizations). A second contribution is to present a thorough complexity analysis of three computational problems, namely verification (check whether a given query is a perfect, or an approximated characterization of a given dataset), existence (check whether a perfect, or a best approximated characterization of a given dataset exists), and computation (compute a perfect, or best approximated characterization of a given dataset).
Fichier principal
Vignette du fichier
Query Definability and Its Approximations in Ontology-based Data Management.pdf (557.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03609548 , version 1 (15-03-2022)

Identifiers

Cite

Gianluca Cima, Federico Croce, Maurizio Lenzerini. Query Definability and Its Approximations in Ontology-based Data Management. CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Nov 2021, Queensland, Australia. ⟨10.1145/3459637.3482466⟩. ⟨hal-03609548⟩

Collections

CNRS ANR
16 View
20 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More