scientific article; zbMATH DE number 962407

MaRDI QIDQ5690670zbMATH OpenFDO

Authors Dingkang Zhou

Publication date 7 January 1997

zbMATH Keywords

attribute subsetcandidate keysstrong primary attributetopological sequence structure

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• scientific article; zbMATH DE number 3913729
• scientific article; zbMATH DE number 4020517
• scientific article; zbMATH DE number 1737506
• scientific article; zbMATH DE number 4074550

Cited in

(6)

• scientific article; zbMATH DE number 988755 (Why is no real title available?)
• scientific article; zbMATH DE number 5158913
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• scientific article; zbMATH DE number 962429 (Why is no real title available?)
• scientific article; zbMATH DE number 962435 (Why is no real title available?)
• Polynomial delay hybrid algorithms to enumerate candidate keys for a relation

This page was built for publication:

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