Ideal non-deterministic operators as a formal framework to reduce the key finding problem

DOI10.1080/00207160.2010.484488zbMath1237.68077OpenAlexW2101984819MaRDI QIDQ3008386

No author found.

Publication date: 15 June 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2010.484488

zbMATH Keywords

functional dependenceminimal keyrealtional database

Mathematics Subject Classification ID

Database theory (68P15) Lattice ideals, congruence relations (06B10)

Related Items (3)

Closure via functional dependence simplification ⋮ Non-deterministic ideal operators: an adequate tool for formalization in data bases ⋮ Canonical dichotomous direct bases

Cites Work

• Deciding implication for functional dependencies in complex-value databases
• Rough computational methods for information systems
• Extremal theorems for databases
• Codes that attain minimum distance in every possible direction
• Non-deterministic ideal operators: an adequate tool for formalization in data bases
• About the Lossless Reduction of the Minimal Generator Family of a Context
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems

This page was built for publication: Ideal non-deterministic operators as a formal framework to reduce the key finding problem