Skip to Main content Skip to Navigation
Journal articles

Possibilistic keys

Abstract : Possibility theory is applied to introduce and reason about the fundamental notion of a key for uncertain data. Uncertainty is modeled qualitatively by assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication problem is characterized axiomatically and algorithmically. Using extremal combinatorics, we then characterize the families of non-redundant possibilistic keys that attain maximum cardinality. In addition, we show how to compute for any given set of possibilistic keys a possibilistic Armstrong relation, that is, a possibilistic relation that satisfies every key in the given set and violates every possibilistic key not implied by the given set. We also establish an algorithm for the discovery of all possibilistic keys that are satisfied by a given possibilistic relation. It is shown that the computational complexity of computing possibilistic Armstrong relations is precisely exponential in the input, and the decision variant of the discovery problem is NP-complete as well as W[2]-complete in the size of the possibilistic key. Further applications of possibilistic keys in constraint maintenance, data cleaning, and query processing are illustrated by examples. The computation of possibilistic Armstrong relations and discovery of possibilistic keys from possibilistic relations have been implemented as prototypes. Extensive experiments with these prototypes provide insight into the size of possibilistic Armstrong relations and the time to compute them, as well as the time it takes to compute a cover of the possibilistic keys that hold on a possibilistic relation, and the time it takes to remove any redundant possibilistic keys from this cover.
Document type :
Journal articles
Complete list of metadatas

Cited literature [66 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02397255
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Friday, December 6, 2019 - 2:33:27 PM
Last modification on : Friday, June 12, 2020 - 3:52:33 AM
Long-term archiving on: : Saturday, March 7, 2020 - 3:08:43 PM

File

balamuralikrishna_25041.pdf
Files produced by the author(s)

Identifiers

Citation

Nishita Balamuralikrishna, Yingnan Jiang, Hemming Köhler, Uwe Leck, Sebastian Link, et al.. Possibilistic keys. Fuzzy Sets and Systems, Elsevier, 2019, 376, pp.1-36. ⟨10.1016/j.fss.2019.01.008⟩. ⟨hal-02397255⟩

Share

Metrics

Record views

180

Files downloads

491