scientific article
From MaRDI portal
Publication:3863100
zbMath0427.68072MaRDI QIDQ3863100
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (18)
Minimum matrix representation of some key system ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Recent combinatorial results in the theory of relational databases ⋮ Dependencies in composite databases ⋮ Minimum matrix representation of Sperner systems ⋮ Some results about normal forms for functional dependency in the relational datamodel ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ SPT(q, k, n)-Codes ⋮ Codes that attain minimum distance in every possible direction ⋮ Functional dependencies distorted by errors ⋮ Functional dependencies in relational databases: A lattice point of view ⋮ The number of keys in relational and nested relational databases ⋮ On minimum matrix representation of closure operations ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases ⋮ Some generalized type functional dependencies formalized as equality set on matrices ⋮ Axiomatization of generalized functional dependences in relational data bases ⋮ Minimum matrix representation of closure operations
This page was built for publication:
