Relationship design using spreadsheet reasoning for sets of functional dependencies

Authors:
János Demetrovics;András Molnár;Bernhard Thalheim
Affiliations:
MTA SZTAKI, Computer and Automation Institute, of the Hungarian Academy of Sciences, Budapest, Hungary;Department of Information Systems, Faculty of Informatics, Eötvös Loránd University Budapest, Budapest, Hungary;Computer Science and Applied Mathematics Institute, University Kiel, Kiel, Germany
Venue:
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Year:
2006

Citing 13
Cited 2

Boyce-Codd normal form and object normal forms

Information Processing Letters
On the number of databases and closure operations

Theoretical Computer Science
Lattices of closure operators

Discrete Mathematics
The entity-relationship model—toward a unified view of data

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
A relational model of data for large shared data banks

Communications of the ACM
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology

Entity-Relationship Modeling: Foundations of Database Technology
From ternary relationship to relational tables: a case against common beliefs

ACM SIGMOD Record
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design

Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints

FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Functional Dependencies and the Semilattice of Closed Classes

MFDBS '89 Proceedings of the 2nd Symposium on Mathematical Fundamentals of Database Systems
An Informal and Efficient Approach for Obtaining Semantic Constraints Using Sample Data and Natural Language Processing

Selected Papers from a Workshop on Semantics in Databases
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey

Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)

Foundations for a fourth normal form over SQL-Like databases

Conceptual Modelling and Its Theoretical Foundations
Appropriate inferences of data dependencies in relational databases

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Entity-Relationship and other common database modeling tools have restricted capabilities for designing a relationship of higher arity. Although a complete and unambiguous specification can be achieved by traditional functional dependencies for relational schemata, use of the traditional formal notation in practice is rare. We propose an alternative way: designing or surveying the properties of a non-binary relationship among object classes or attributes is considered by spreadsheet reasoning methods for functional dependencies. Another representation by the semilattice of closed attribute sets can also be used in parallel due to convenient conversion facilities.