Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hannula, Miika, Hirvonen, Minna, Kontinen, Juha, Link, Sebastian
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2505.05866
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914082051850240
author Hannula, Miika
Hirvonen, Minna
Kontinen, Juha
Link, Sebastian
author_facet Hannula, Miika
Hirvonen, Minna
Kontinen, Juha
Link, Sebastian
contents We initiate an investigation how the fundamental concept of independence can be represented effectively in the presence of incomplete information in relational databases. The concepts of possible and certain independence are proposed, and first results regarding the axiomatisability and computational complexity of implication problems associated with these concepts are established. In addition, several results for the data and the combined complexity of model checking are presented. The findings help reduce computational overheads associated with the processing of updates and answering of queries.
format Preprint
id arxiv_https___arxiv_org_abs_2505_05866
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Independence Under Incomplete Information
Hannula, Miika
Hirvonen, Minna
Kontinen, Juha
Link, Sebastian
Databases
We initiate an investigation how the fundamental concept of independence can be represented effectively in the presence of incomplete information in relational databases. The concepts of possible and certain independence are proposed, and first results regarding the axiomatisability and computational complexity of implication problems associated with these concepts are established. In addition, several results for the data and the combined complexity of model checking are presented. The findings help reduce computational overheads associated with the processing of updates and answering of queries.
title Independence Under Incomplete Information
topic Databases
url https://arxiv.org/abs/2505.05866