Metraipolis › archive › dc_2a0747d7669f
Approximate Functional Dependencies---Implication Problem Revisited — arXiv:2608.16570
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16570
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T23:35:36.407Z
- SHA-256 of the archived text
7b42e08e275776f48c85a525ec6f1ec420904a7e7609021dc04753e81e017ccd- Stable URL of this page
https://metraipolis.com/documento/dc_2a0747d7669f
How to cite
Approximate Functional Dependencies---Implication Problem Revisited — arXiv:2608.16570 — arXiv (en), https://arxiv.org/abs/2608.16570 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2a0747d7669f (Metraipolis archive dc_2a0747d7669f, sha256 7b42e08e275776f48c85a525ec6f1ec420904a7e7609021dc04753e81e017ccd)
BibTeX
@misc{dc2a0747d7669f,
title = {Approximate Functional Dependencies---Implication Problem Revisited — arXiv:2608.16570},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16570},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2a0747d7669f; sha256 7b42e08e275776f48c85a525ec6f1ec420904a7e7609021dc04753e81e017ccd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16570. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Functional dependencies are an important and well-studied class of database constraints that correspond to a notion expressed by dependence atoms in team logic. In practice, data often contain errors, so in some cases it might be useful to allow the database to have a small number of tuples that violate the desired dependency. Väänänen (2017) studied the axiomatisation of a notion of approximate dependence that specifies for each dependence atom how much of the database can be disregarded. We demonstrate that the interaction of approximate dependence atoms is more complicated than previously thought in the sense that there is a semantic consequence that is not captured by the inference rules introduced before. We show that Väänänen's axiomatisation is still complete in the restricted case of unary dependencies. We also consider the complexity of model checking for approximate dependence: it is NP-complete for disjunctions of two atoms and LOGSPACE-hard for individual atoms. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DB). Categorie arXiv: Logic in Computer Science (cs.LO) ; Databases (cs.DB). Pagina del lavoro: https://arxiv.org/abs/2608.16570 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T23:02:17.580Z dalla pagina https://arxiv.org/catchup/cs.DB/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).