Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
From MaRDI portal
Recommendations
Cites work
- A polynomial delay algorithm for generating connected induced subgraphs of a given cardinality
- A relational model of data for large shared data banks
- Algorithms for inferring functional dependencies from relations
- An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
- An optimal key enumeration algorithm and its application to side-channel attacks
- Candidate keys for relations
- Functional and approximate dependency mining: database and FCA points of view
- scientific article; zbMATH DE number 6519673 (Why is no real title available?)
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the enumeration of minimal dominating sets and related notions
- On the Structure of Armstrong Relations for Functional Dependencies
- Reverse search for enumeration
- The joy of implications, aka pure Horn formulas: mainly a survey
- Unique key Horn functions
This page was built for publication: Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648284)