Possibilistic keys

DOI10.1016/J.FSS.2019.01.008zbMATH Open1423.94049OpenAlexW4206248846MaRDI QIDQ2329094FDOQ2329094

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

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

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)

Cites Work

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

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

Uses Software

• UCI-ml

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)