Skip to Main content Skip to Navigation
Conference papers

Query Definability and Its Approximations in Ontology-based Data Management

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).
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03609548
Contributor : Gianluca Cima Connect in order to contact the contributor
Submitted on : Tuesday, March 15, 2022 - 4:08:30 PM
Last modification on : Saturday, June 25, 2022 - 10:44:47 AM
Long-term archiving on: : Thursday, June 16, 2022 - 6:46:48 PM

File

Query Definability and Its App...
Files produced by the author(s)

Identifiers

Collections

CNRS | ANR

Citation

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⟩

Share

Metrics

Record views

8

Files downloads

10