Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
An extension of conflict-free multivalued dependency sets
ACM Transactions on Database Systems (TODS)
Alpha-acyclic decompositions of relational database schemes
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A formal view integration method
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A comparative analysis of methodologies for database schema integration
ACM Computing Surveys (CSUR)
Update and retrieval in a relational database through a universal schema interface
ACM Transactions on Database Systems (TODS)
Models for the Combined Logical and Physical Design of Databases
IEEE Transactions on Computers
Independence-reducible database schemes
Journal of the ACM (JACM)
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
An integrated approach to logical design of relational database schemes
ACM Transactions on Database Systems (TODS)
Database design for incomplete relations
ACM Transactions on Database Systems (TODS)
A high-level user interface for update and retrieval in relational databases—language aspects
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
An improved third normal form for relational databases
ACM Transactions on Database Systems (TODS)
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
Journal of the ACM (JACM)
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Designing globally consistent network schemas
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A universal relation database system implemented via the network model
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A Parallel Algorithm for Relational Database Normalization
IEEE Transactions on Parallel and Distributed Systems
Comprehensive Approach to the Design of Relational Database Schemes
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Reflections on Boyce-Codd Normal Form
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Database Decomposition into Fourth Normal Form
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Decomposition of a relation scheme into Boyce-Codd Normal Form
ACM '80 Proceedings of the ACM 1980 annual conference
A Step by Step Method for Conceptual Data Analysis
SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Decomposition of a relation scheme into Boyce-Codd Normal Form
ACM SIGACT News
On inferences of full hierarchical dependencies
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Full hierarchical dependencies in fixed and undetermined universes
Annals of Mathematics and Artificial Intelligence
Independent components of databases
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Constraint acquisition you can chase but you cannot find
APCCM '08 Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 79
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
An information-theoretic analysis of worst-case redundancy in database design
ACM Transactions on Database Systems (TODS)
Appropriate reasoning about data dependencies in fixed and undetermined universes
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Autonomous sets: a method for hypergraph decomposition with applications in database theory
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Lossless decompositions in complex-valued databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
The boyce-codd-heath normal form for SQL
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Finding faithful boyce-codd normal form decompositions
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
Autonomous sets for the hypergraph of all canonical covers
Annals of Mathematics and Artificial Intelligence
FD covers and universal complements of simple projections
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Letting keys and functional dependencies out of the bag
APCCM '13 Proceedings of the Ninth Asia-Pacific Conference on Conceptual Modelling - Volume 143
Hi-index | 0.00 |
We study the following database design problem. Given a universal relation scheme 〈U, F〉 where F is a set of functional dependencies, find an in some way normalized database schema D = {〈X1, F1〉,..., 〈Xn, Fn〉} where Xi ⊂ U and Fi is inherited from F, such that D is an independent representation of the universal scheme 〈U, F〉. This means that D has both the lossless join property and the faithful closure property, (***** Fi)+ = F+, where + denotes the closure of a set of functional dependencies. We show that this goal can easily be achieved by an extension of the well-known synthetic approach of Bernstein and others to database design. We merely have to check whether the usual synthesis procedure has produced a key component 〈Xi, Fi〉 such that Xi → U ε F+; in case this is true the output of the synthesis procedure is actually an independent (and not only faithful) representation, otherwise we only have to add one further component, namely just a key. These claims are proved by a careful inspection of the Aho/Beeri/Ullman algorithm to test for losslessness. Finally, we show how to use our method to synthesize minimal independent third normal form schemas.