Counter-free keys and functional dependencies in higher-order datamodels

zbMATH Open1101.68526MaRDI QIDQ5480180FDOQ5480180

Attila Sali, Klaus-Dieter Schewe

Publication date: 26 July 2006

Recommendations

• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems
• Keys and Armstrong databases in trees with restructuring
• scientific article; zbMATH DE number 5200724
• Weak functional dependencies on trees with restructuring

zbMATH Keywords

keysfunctional dependenciesaxiomatisationSperner familiestype constructors

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (7)

• SPT(q, k, n)-Codes
• Functional dependencies on extended relations defined by regular languages
• Codes that attain minimum distance in every possible direction
• Coding Theory Motivated by Relational Databases
• Title not available (Why is that?)
• A characterisation of coincidence ideals for complex values
• On the Existence of Armstrong Instances with Bounded Domains

This page was built for publication: Counter-free keys and functional dependencies in higher-order datamodels

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