Keys and Armstrong databases in trees with restructuring

MaRDI QIDQ3615286zbMATH OpenFDO

Authors Attila Sali, Klaus-Dieter Schewe

Publication date 19 March 2009

zbMATH Keywords

Armstrong databaseskeys

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 823631
• Functional dependencies among Boolean dependencies
• scientific article; zbMATH DE number 4049168
• The number of keys in relational and nested relational databases
• Foundations of Information and Knowledge Systems

Cited in

(11)

• The number of keys in relational and nested relational databases
• Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
• Possibilistic keys
• Codes that attain minimum distance in every possible direction
• Note on the size of binary Armstrong codes
• scientific article; zbMATH DE number 1665450 (Why is no real title available?)
• Coding theory motivated by relational databases
• SPT(q, k, n)-Codes
• On the Existence of Armstrong Instances with Bounded Domains
• Counter-free keys and functional dependencies in higher-order datamodels
• Foundations of Information and Knowledge Systems

This page was built for publication: Keys and Armstrong databases in trees with restructuring

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