Possibilistic keys

DOI10.1016/J.FSS.2019.01.008MaRDI QIDQ2329094zbMATH OpenOpenAlexFDO

Authors Nishita Balamuralikrishna, Yingnan Jiang, Uwe Leck, Sebastian Link, Henri Prade, Henning Koehler

Publication date 17 October 2019

Published in Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL https://oatao.univ-toulouse.fr/25041/1/balamuralikrishna_25041.pdf

zbMATH Keywords

databaseextremal combinatoricsArmstrong relationaxiomatizationkeyimplicationuncertain datapossibility theorydiscoveryconstraint maintenance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Logical foundations of possibilistic keys
• Keys and Armstrong databases in trees with restructuring
• Automated reasoning about key sets
• Extremal combinatorics of SQL keys
• scientific article; zbMATH DE number 2089444

Cites work

• scientific article; zbMATH DE number 4057058 (Why is no real title available?)
• scientific article; zbMATH DE number 41085 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 1016362 (Why is no real title available?)
• scientific article; zbMATH DE number 1081152 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• A relational model of data for large shared data banks
• Algorithms for inferring functional dependencies from relations
• Automated reasoning about key sets
• Axioms and algorithms for inferences involving probabilistic independence
• Design by example: An application of Armstrong relations
• Extremal combinatorics of SQL keys
• Fundamentals of parameterized complexity
• Horn clauses and database dependencies
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Keys and Armstrong databases in trees with restructuring
• Logical foundations of possibilistic keys
• Numerical constraints on XML data
• On the Structure of Armstrong Relations for Functional Dependencies
• On the conditional independence implication problem: a lattice-theoretic approach
• Possibilistic Conditional Tables
• Probabilistic databases
• Refinements of the maximum approach to decision-making in a fuzzy environment
• The parameterized complexity of dependency detection in relational databases

Cited in

(5)

• Logical foundations of possibilistic keys
• Minimal Armstrong databases for cardinality constraints
• Automated reasoning about key sets
• Possibilistic Bounds for Granular Counting
• Controlling entity integrity with key sets

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Possibilistic keys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329094)