Metraipolis › archive › dc_cb376ebefe88

Optimal Repairs for Unary Functional Dependencies: Resolving the Case of Updates — arXiv:2608.15328

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.15328
License (as archived): CC0-1.0
Archived: 2026-10-18T23:35:34.695Z
SHA-256 of the archived text: 0698fbc699511da8f1f0c74e491d1c1f65858a43538f85601c0b2f49cc766e0c
Stable URL of this page: https://metraipolis.com/documento/dc_cb376ebefe88

How to cite

Optimal Repairs for Unary Functional Dependencies: Resolving the Case of Updates — arXiv:2608.15328 — arXiv (en), https://arxiv.org/abs/2608.15328 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb376ebefe88 (Metraipolis archive dc_cb376ebefe88, sha256 0698fbc699511da8f1f0c74e491d1c1f65858a43538f85601c0b2f49cc766e0c)

BibTeX

@misc{dccb376ebefe88,
  title = {Optimal Repairs for Unary Functional Dependencies: Resolving the Case of Updates — arXiv:2608.15328},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15328},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb376ebefe88; sha256 0698fbc699511da8f1f0c74e491d1c1f65858a43538f85601c0b2f49cc766e0c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15328. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

If a table violates its required set of functional dependencies (FDs), what is the minimum number of cell changes needed to restore consistency? This fundamental problem, known as finding an optimal update repair (U-repair), is known to admit polynomial-time algorithms only for a small number of specific FD sets. Whether additional tractable cases exist has remained open. The only established hardness result for this problem is due to Kolahi and Lakshmanan (2009); subsequent attempts to prove hardness for additional cases have failed, leaving these cases unresolved. In this work, we make substantial progress on this open problem by completely resolving the case of unary FDs, in which every FD has a single attribute on its left-hand side. We show that every set of unary FDs either falls into one of the previously known tractable classes or makes the problem of finding an optimal U-repair NP-hard.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DB).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Databases (cs.DB).
Pagina del lavoro: https://arxiv.org/abs/2608.15328 — 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.579Z 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).