Pages that link to "Item:Q4886686"
From MaRDI portal
The following pages link to An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema (Q4886686):
Displayed 8 items.
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- An efficient algorithm for 3NF determination (Q558039) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- (Q5018497) (← links)
- A Port Graph Rewriting Approach to Relational Database Modelling (Q5097637) (← links)
- Analysis of fuzzy -ary relations with the use of interval-valued fuzzy functional dependencies (Q5326156) (← links)
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory (Q5445294) (← links)
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)