Algorithms for inferring functional dependencies from relations
- 1 February 1994
- journal article
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 12 (1) , 83-99
- https://doi.org/10.1016/0169-023x(94)90023-x
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the complexity of inferring functional dependenciesDiscrete Applied Mathematics, 1992
- Decomposing a relation into a tree of binary relationsJournal of Computer and System Sciences, 1990
- On generating all maximal independent setsInformation Processing Letters, 1988
- Design by example: An application of Armstrong relationsJournal of Computer and System Sciences, 1986
- Inclusion dependencies and their interaction with functional dependenciesJournal of Computer and System Sciences, 1984
- On the Structure of Armstrong Relations for Functional DependenciesJournal of the ACM, 1984
- Mapping Uninterpreted Schemes into Entity-Relationship Diagrams: Two Applications to Conceptual Schema DesignIBM Journal of Research and Development, 1984
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977