Functional dependencies in relations with null values
Information Processing Letters
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
The unified software development process
The unified software development process
Database Management Systems
The minimum equivalent DNF problem and shortest implicants
Journal of Computer and System Sciences
The Complexity of Set Constraints
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
On the Problem of Computing Small Representations of Least Common Subsumers
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
The GMAP: a versatile tool for physical data independence
The VLDB Journal — The International Journal on Very Large Data Bases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Compound term composition algebra: the semantics
Journal on Data Semantics II
Optimizing Polynomial Expressions by Algebraic Factorization and Common Subexpression Elimination
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex schemas. The simplicity and conciseness of a schema depends critically on the idioms available to express the schema. We propose a formal conceptual schema representation language that combines different design formalisms, and allows schema manipulation that exposes the strengths of each of these formalisms. We demonstrate how the schema factorization framework can be used to generate relational, object-oriented, and faceted physical schemas, allowing a wider exploration of physical schema alternatives than traditional methodologies. We illustrate the potential practical benefits of schema factorization by showing that simple heuristics can significantly reduce the size of a real-world schema description. We also propose the use of schema polynomials to model and derive alternative representations for complex relationships with constraints.