Candidate keys for relations
From MaRDI portal
Publication:1253096
DOI10.1016/0022-0000(78)90009-0zbMath0395.68025WikidataQ56227692 ScholiaQ56227692MaRDI QIDQ1253096
Cláudio Leonardo Lucchesi, Sylvia L. Osborn
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90009-0
68Q25: Analysis of algorithms and problem complexity
68P05: Data structures
68P20: Information storage and retrieval of data
68W99: Algorithms in computer science
Related Items
Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory, On the Complexity of Computing Generators of Closed Sets, Autonomous sets for the hypergraph of all canonical covers, An efficient algorithm for 3NF determination, Some problems concerning keys for relation schemes and relations in the relational datamodel, Closed sets and translations of relation schemes, Towards an abstract theory of dependency constraints in relational databases, On the desirability of \(\gamma\)-acyclic BCNF database schemes, The complexity of recognizing 3NF relation schemes, Polynomial tests of normal forms and some related results, Functional dependencies in relational databases: A lattice point of view, The number of keys in relational and nested relational databases, Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel, An algebraic point of view of the data structures of database systems, On the relationship of minimum and optimum covers for a set of functional dependencies, Some results about normal forms for functional dependency in the relational datamodel, A Generalisation of Entity and Referential Integrity in Relational Databases, Some Remarks on Relational Database Schemes Having Few Minimal Keys, Unnamed Item
Cites Work
