Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Partition semantics for relations
Journal of Computer and System Sciences
The partition model: a deductive database model
ACM Transactions on Database Systems (TODS)
Computing covers for embedded functional dependencies
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Identifying Extended Entity-Relationship Object Structures in Relational Schemas
IEEE Transactions on Software Engineering
The design of relational databases
The design of relational databases
On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Reverse engineering of relational databases: extraction of an EER model from a relational database
Data & Knowledge Engineering
Algorithms for inferring functional dependencies from relations
Data & Knowledge Engineering
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
Fast discovery of association rules
Advances in knowledge discovery and data mining
Object normal forms and dependency constraints for object-oriented schemata
ACM Transactions on Database Systems (TODS)
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
Database design for incomplete relations
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Decompositions and functional dependencies in relations
ACM Transactions on Database Systems (TODS)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Efficient Discovery of Functional Dependencies and Armstrong Relations
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Query Folding with Inclusion Dependencies
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A Feasibility and Performance Study of Dependency Inference
Proceedings of the Fifth International Conference on Data Engineering
Towards the Reverse Engineering of Denormalized Relational Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Algorithms for Mining Inclusion Dependencies
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Improving Query Evaluation with Approximate Functional Dependency Based Decompositions
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Automatically extracting class diagrams from spreadsheets
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Interactively eliciting database constraints and dependencies
CAiSE'11 Proceedings of the 23rd international conference on Advanced information systems engineering
Towards a parallel approach for incremental mining of functional dependencies on multi-core systems
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
A parallel algorithm for computing borders
Proceedings of the 20th ACM international conference on Information and knowledge management
Using functional dependencies for reducing the size of a data cube
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Discovering functional dependencies from existing databases is an important technique strongly required in database design and administration tools. Investigated for long years, such an issue has been recently addressed with a data mining viewpoint, in a novel and more efficient way by following from principles of level-wise algorithms. In this paper, we propose a new characterization of minimal functional dependencies which provides a formal framework simpler than previous proposals. The algorithm, defined for enforcing our approach has been implemented and experimented. It is more efficient (in whatever configuration of original data) than the best operational solution (according to our knowledge): the algorithm Tane. Moreover, our approach also performs (without additional execution time) the mining of embedded functional dependencies, i.e. dependencies holding for a subset of the attribute set initially considered (e.g. for materialized views widely used in particular for managing data warehouses).