Dependency Structures of Data Base Relationships
Explore this paper's citation graph
Summary
The -semi-lattice of the B in maximal dependencies is shown to determine the dependency structure completely and some insight into recent work on use of boolean functions in the data base decomposition is provided.
- Type
- article
- Published
- 1974-01-01
- Cited by
- 788
- References
- 2
- OpenAlex
- https://openalex.org/W43035074
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:38788061
Keywords
Dependency (UML), Computer science, Base (topology), Data science, Information retrieval
References
Cited by
- Relational Data Base Design Using Refinement Rules
- What does Boyce-Codd Normal Form Do?
- A sharing-based approach to supporting adaptation in service compositions
- A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
- Some Analytic Tools for the Design of Relational Database Systems
- On the Updatability of Relational Views
- Evaluating DATALOG Programs over Infinite and Founded Databases
- Active Data Dictionary: a Method and a Tool for Data Model Driven Information System Design
- A new Informative Generic Base of Association Rules
- The Information Preserving Properties of Relational Database Transformations
- Mutual Dependencies and Some Results on Undecomposable Relations
- A Lattice View of Functional Dependencies in Incomplete Relations
- Axiomatizations of Fuzzy Attribute Logic
- The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design
- Surmise relations between tests: Preliminary results of the mathematical modeling
- Some results about functional dependencies
- THE SEMANTIC JUSTIFICATION FOR NORMAL FORMS IN RELATIONAL DATABASE DESIGN
- On the Number of Keys of a Relational Database Schema
- Independence and Functional Dependence Relations on Secrets
- Consensus de familles de Moore typées
Related papers
- Formal Concept Analysis: Tutorial on formal concept analysis
- Further Normalization of the Data Base Relational Model
- A relational model of data for large shared data banks
- Computational problems related to the design of normal form relational schemas
- Functional Dependencies in a Relational Data Base and Propositional Logic
- A complete axiomatization for functional and multivalued dependencies in database relations
- Multivalued dependencies and a new normal form for relational databases
- Decomposition of a Data Base and the Theory of Boolean Switching Functions